1. Factory PQR produces two products, product X and product Y. The Factory employs five workers: three machinists and two assemblers; and that each of them works only 40 hours a week. Product X and/or Y can be produced by these workers subject to the following constraints: • Product X requires three hours of machining and one hour of assembly per unit; Product Y requires two hours of machining and two hours of assembly per unit. If you can realize $10 profit per unit of product X and $14 profit per unit of product Y, state the problem in a formal Linear Programming equations ! 2. Perform iterations of the Simplex method to find the production level of product X and product Y in Question No. 1! 3. Write down your conclusion that you get from Question No. 2 ! 4. Formulate the dual of the LP equations that you have from No. 1 ! 5. Solve the Dual LP problem with Excel Solver ! 6. Explain the connection between the solution in Primal problem (from No.2) and the solution in Dual problem (from No. 5) !

1. Factory PQR produces two products, product X and product Y. The Factory employs five workers: three machinists and two assemblers; and that each of them works only 40 hours a week. Product X and/or Y can be produced by these workers subject to the following constraints: • Product X requires three hours of machining and one hour of assembly per unit; Product Y requires two hours of machining and two hours of assembly per unit. If you can realize $10 profit per unit of product X and $14 profit per unit of product Y, state the problem in a formal Linear Programming equations ! 2. Perform iterations of the Simplex method to find the production level of product X and product Y in Question No. 1! 3. Write down your conclusion that you get from Question No. 2 ! 4. Formulate the dual of the LP equations that you have from No. 1 ! 5. Solve the Dual LP problem with Excel Solver ! 6. Explain the connection between the solution in Primal problem (from No.2) and the solution in Dual problem (from No. 5) !

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter4: Linear Programming Models

Section: Chapter Questions

Problem 73P

See similar textbooks

Similar questions

#1- Maxwell Manufacturing makes two models of felt tip marking pens. Requirements and available resources for each lot of pens are given in the following table: Fliptop Model Tiptop Model Available Plastic 3 4 36 Ink Assembly 5 4 40 Molding Time 5 2 30 The profit for either model is $1,000 per lot. a) What is the linear programming model for this problem? b) Using Microsoft Excel's Solver, find the optimal solution. How many Fliptop models and how many Tiptop models should be produced? What is the maximum profit? c) Will there be excess capacity in any resource? Use Excel's Solver and run a sensitivity report to answer the following questions. d) Over which range can the objective function coefficient for Fliptop Models change without affecting the original optimal solution? What is this range called? e) What is the shadow price (dual price) for the plastic constraint and how would you interpret it? f) What is the shadow price (dual price)…
Maxwell Manufacturing makes two models of felt tip marking pens. Requirements for each lot of pen...Maxwell Manufacturing makes two models of felt tip marking pens. Requirements for each lot of pens are given below.Fliptop Model Tiptop Model AvailablePlastic 3 4 36Ink Assembly 5 4 40Molding Time 5 2 30The profit for either model is $1000 per lot.What is the linear programming model for this problem?What are the boundary points of the feasible region?What is the profitability at each boundary point of the feasible region?Find the optimal solution.
The demand for subassembly S is 100 units inweek 7. Each unit of S requires 1 unit of T and 2 units of U.Each unit of T requires 1 unit of V, 2 units of W, and 1 unit ofX. Finally, each unit of U requires 2 units of Y and 3 units ofZ. One firm manufactures all items. It takes 2 weeks to makeS, 1 week to make T, 2 weeks to make U, 2 weeks to make V,3 weeks to make W, 1 week to make X, 2 weeks to make Y,and 1 week to make Z.a) Construct a product structure. Identify all levels, parents,and components.b) Prepare a time-phased product structure.
An XYZ company has a W, H, O plant with a monthly production capacity of 60 tons, 50 tons, and 42 tons, respectively; and has 3 sales warehouses in cities A, B, C, D Where each warehouse has a monthly requirement of 30 tons, 34 tons, 44 tons and 25 tons. With shipping cost W to ABCD = IDR 12,000,-, IDR. 8.000,-, Rp. 12.000,-, Rp. 14,000,-; H to A B C D = Rp. 8.000,-, Rp. 18.000,-, Rp. 10,000,-, Rp. 6.000,-; and O to ABCD = Rp. 16.000,-, Rp. 16.000,-, Rp. 2,000, Rp. 10,000,-. Please calculate using Vogel's Approximation Method or VAM Question a. What is the best transportation model in your opinion to solve the above problems? b. What is the minimum transportation cost to solve the shipping transportation problem! c. Based on these calculations, give suggestions regarding the transportation model and the amount of costs incurred by the company!
Quality Air Conditioning manufactures three home air conditioners: an economy model, a standard model, and a deluxe model. The profits per unit are $67, $95, and $133, respectively. The production requirements per unit are as follows: Number ofFans Number ofCooling Coils ManufacturingTime (hours) Economy 1 1 8 Standard 1 2 12 Deluxe 1 4 14 For the coming production period, the company has 300 fan motors, 340 cooling coils, and 2000 hours of manufacturing time available. How many economy models (E), standard models (S), and deluxe models (D) should the company produce in order to maximize profit? The linear programming model for the problem is as follows: Max 67E + 95S + 133D s.t. 1E + 1S + 1D ≤ 300 Fan motors 1E + 2S + 4D ≤ 340 Cooling coils 8E + 12S + 14D ≤ 2000 Manufacturing time E, S, D ≥ 0 The computer solution is shown in the figure below. Optimal Objective Value = 17380.00000 Variable Value…
Amy Zeng, owner ofZeng's Restaurant Distributions,supplies nonperishable goods to restaurants around the metroarea. She stores all the goods in a storage area with a single dockand one aisle. The goods are divided into five categories accordingto the following table. The table indicates the number of tripsper month to store or retrieve items in each category, as well asthe number of storage blocks taken up by each. The following picture of the storage area provides an identificationnumber for each of the 16 storage blocks. For each item category,indicate into which blocks it should be stored.
1. Maribel is selling regular and special juices. To make a bottle of regularjuice, she needs 2 pounds of mango and 3 pounds of pineapple. On theother hand, 4 pounds of mango and 2 pounds of pineapple are needed tomake a bottle of special juice. A profit of P30 is made for a bottle of regularjuice and P40 for a bottle of special juice. Maribel is currently has 800pounds of mango and 480 pounds of pineapple. She wants to make at least180 bottles of special juice. How many bottles of each type of juice mustshe make to maximize her profit? How much will be her maximum profit? 2. A calculator company produces a scientific calculator and a graphingcalculator. Long-term projections indicate an expected demand of atleast 100 scientific and 80 graphing calculators each day. Because oflimitations on production capacity, no more than 200 scientificand 170 graphing calculators can be made daily. To satisfy a shippingcontract, a total of at least 200 calculators much be shipped each day. Ifeach…
Given this linear programming model, solve the model and then answer the questions that follow. Maximize Z = 12x1 + 18x2 + 15x3 where x1 = the quantity of product 1 to make, etc. Subject to Machine: 5x 1 + 4x 2 + 3x 3 ≤ 160 minutes Labor: 4x1 + 10x2 + 4x3 ≤ 288 hours Materials: 2x 1 + 2x2 + 4x3 ≤ 200 pounds Product 2: x2 ≤ 16 units x1, x2, x3 ≥ 0 a) Are any constraints binding? If so, which one(s)? b) If the profit on product 3 were changed to $22 a unit, what would the values of the decision variables be? The objective function? Explain. c) If the profit on product 1 were changed to $22 a unit, what would the values of the decision variables be? The objective function? Explain. d) If 10 hours less of labor time were available, what would the values of the decision variables be? The objective function? Explain. e) If the manager decided that as many as 20 units of product 2 could be produced (instead of 16), how much additional profit would be generated? f) If profit per unit on each…
Although the problems say solve graphically, please solve all problems using the QM for Windows software or solve manually. B.6 The Christina Alvarez Company manufactures two lines of designer yard gates, called model A and model B. Every gate requires blending a certain amount of steel and zinc, the company has available a total of 25.000 Ib of steel and 6,000 lb of zinc. Each model A gate requires a mixture of 125 Ib of steel and 20 lb of zinc, and each yields a profit of 590. Each model B gate requires 100 1b of steel and 30 ib of zinc and can be sold for a profit of $70. Find by graphical IP the best production mix of yard gates.
Please note that this question is different from what you have in your library. This question has 3 variables ie 3 departments. Please help solve the problem. A co markets 2 products which are produced in 3 successive departments. The contribution per unit of the 2 products and the production capacity of the 3 departments are X. Y Contribution. 10. 15 Machining dept (hrs) 3. 4 Foundry dept (hrs) 4 2 Painting dept (hrs) 4 5 A constraint on production is that each dept has a limited number of hours available for the forthcoming plan period as shown below: Department. Available hours Machining. 1'200 Foundry. 1000 Painting. 1300 Required- 1. Formulate the linearr programming problem for the above information. 2. Solve them graphically
Due to the unavailability of desired quality of raw materials, ABC Ltd. can manufacture maximum 80 units of product A & 60 units of product B. A consumes 5 units and B consumes 6 units of raw materials in the manufacture respectively and their respective profit margins one RO 50 & RO 80. Further, A requires 1 man-day of labour per unit & B requires 2 man-day of labour per unit. The constraints operating are: Supply of raw material - maximum 600 units Supply of labour - maximum 160 man-days. Formulate as a LP model & solve graphically.
Consider the following LP problem: Min 6X+ 18Y; Subject to : 3 X + 9Y <= 47, and X + Y <= 141. Which one of the following is true?: a. Slack for each constraint is zero. b. Optimal Obj. function value is 94 c. X=70.5, Y=70.5 is the only optimal solution. d. Optimal Obj. function value is 0