The following linear programming problem described the manufacturing two products (X1 & X2) by using two raw materials (R1 & R2); Max. Z= 3X1 + 4X2 Subject to: 2X1 + 3X2 1200 (Constraint of raw material R1) 2X1 + X2s 1000 (Constraint of raw material R2) X2s 200 (Demand for product X2) X1 X2 2 0 1- By using the Algebraic Analysis, find whether a change in the right-hand side for constraint of raw material R1, (1200), and the current basis remains optimal. 2- Change this linear programming model to Dual Problem Model, and find the values of the variables and W by using the optimal simplex tableau which shown below.

The following linear programming problem described the manufacturing two products (X1 & X2) by using two raw materials (R1 & R2); Max. Z= 3X1 + 4X2 Subject to: 2X1 + 3X2 1200 (Constraint of raw material R1) 2X1 + X2s 1000 (Constraint of raw material R2) X2s 200 (Demand for product X2) X1 X2 2 0 1- By using the Algebraic Analysis, find whether a change in the right-hand side for constraint of raw material R1, (1200), and the current basis remains optimal. 2- Change this linear programming model to Dual Problem Model, and find the values of the variables and W by using the optimal simplex tableau which shown below.

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter2: Introduction To Spreadsheet Modeling

Section: Chapter Questions

Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...

See similar textbooks

Similar questions

b) The Scott Tractor Company ships tractor parts from Omaha to St. Louis by railroad. However, a contract limits the number of railroad cars the company can secure on each branch/arc during a week. Given these limiting conditions, the company wants to know the maximum number of railroad cars containing tractor parts that can be shipped from Omaha to St. Louis during a week. Phoenix Des Moines 3 5 6. 6. 1. Dallas 2 Omaha St. Louis 7. 3 Denver 6. ActivateW O 31°C
WK Qu. 7-11 A firm has prepared the following binary... A firm has prepared the following binary integer program to evaluate a number of potential locations for new warehouses. The firm's goal is to maximize the net present value of their decision while not spending more than their currently available capital. Max 35x1 + 25x2 +15x3+ 30x4 s.t. 7x1 + 8x2 +7x3 + 13x4 ≤ 18 [Constraint 1} + x4 ≥ 2 [Constraint 2} X1 + x2 + x3 X1 + X2 ≤ 1 [Constraint 3} X1 + X3 ≥ 1 [Constraint 4) X2=X4 [Constraint 5) 1, if location j is selected xj = 0, otherwise Solve this problem to optimality and answer the following questions: a. Which of the warehouse locations will/will not be selected? Location 1 will Location 2 will Location 3 will Location 4 will be selected not be selected Net present value be selected not be selected b. What is the net present value of the optimal solution? (Round your answer to the nearest whole number.) 50 c. How much of the available capital will be spent (Hint: Constraint 1…
Problem 2: Applications of Linear Programming: Visa Inc. Stock sells for $92 a share and has 3-year average annual return of $20 a share. The beta value is 1.06. JP Morgan Chase and Co. sells for $87 a share and has a 3-year average annual return of $17 a share. The beta value is 1.21. Derek wants to spend no more than $15,000 investing in these two stocks, but he wants to earn at least $2500 in annual revenue. Derek also wants to minimize the risk. Determine the number of shares of each stock that Derek should buy.
The Ace Manufacturing Company has orders for three similar products: Product Order (Units) A 1750 B 500 C 1100 Three machines are available for the manufacturing operations. All three machines can produce all the products at the same production rate. However, due to varying defect percentages of each product on each machine, the unit costs of the products vary depending on the machine used. Machine capacities for the next week and the unit costs are as follows: Machine Capacity (Units) 1 1550 2 1450 3 1150 Product Machine A B C 1 $0.80 $1.30 $0.70 2 $1.40 $1.30 $1.50 3 $0.80 $0.80 $1.20 Use the transportation model to develop the minimum cost production schedule for the products and machines. Show the linear programming formulation. If the constant is "1" it must be entered in the box. If your answer is zero enter "0". The linear programming formulation and optimal solution are shown. Let xij = Units of product j on machine i.…
Which of the folowing linear programming model has an unbounded feasible region? = 3x + 2y subject to the following : O max z x+ y34 *< 10 – 4y x20 y20 O None of the above O max z = 3x + 2y subject to the following : x+ 2y <4 x- ys1 x20 y20 O max z = 4x +2y subject to the following : x + 2y 24 3x + y27 -x + 2y s7 x20 y20
The sketch of a feasible region is given below, which point is not a point consistent with a production option for this programming problem? (0,10) (0,8) (0,0) O (0,6) O (4,0) O (4,2) O (6,0) (2,8) (6,4) (6,0) 27 (10,0) They are all in the feasible region.
1 ton of material 1 ton of material 2, and 11/13 3 10 The Kashif Corporation blends three raw materials to produce two products: a fuel additive and a solvent base. Each ton of fuel additive is a mixture of ton of material 1 and 3 ton of material 3. A ton of solvent base is a mixture of // Kashif's production is constrained by a limited availability of the three raw materials. For the current production period, Kashif has the following quantities of each raw material: material 1, 20 tons; material 2, 5 tons; material 3, 21 tons. Management wants to achieve the following P, priority level goals. Goal 1: Produce at least 30 tons of fuel additive. Goal 2: Produce at least 15 tons of solvent base. Assume there are no other goals. (a) Is it possible for management to achieve both P₁ level goals given the constraints on the amounts of each material available? If not, which constraint is the limiting factor? O Yes. It is possible to satisfy both P₁ level goals. O No. There is an insufficient…
linear programming problem. one image is the question and the other image is required information.
Suppose X1 and X2 are defined as: X1 =number of tables to produce, X2 =number of chairs to produce. Answer the following questions: (a) Write an expression representing total number of tables and chairs to be produced in terms of X1 and X2. (b) Suppose a table generates $28 of profit, and a chair generates $24 of profit. What is the expression representing the total profit of X1 tables and X2 chairs? (c) Suppose a table takes 3.3 hours of carpentry and 2.7 hours of painting. What is the expression representing total number of painting hours to be used for producing X1 tables? (d) Suppose a table takes 3 hours of carpentry, a chair takes 2 hours of carpentry, and there are 400 hours of carpentry available. Use a constraint to represent “The total carpentry hours to be used should be no more than the available carpentry hours.” (e) Use a constraint to represent “At least 34 chairs must be produced”; (f) Use a constraint to represent “No more than 380 chairs will be produced.” (g) Use a…
Monsters, Inc. has two plants for producing electricity, one in Monsterville and another is in New Yeti. The Monsterville plant produces according to eM(x1,x2) = min{xX1,2x2} and the New Yeti plant produces according to eNY(x1,x2) = min{2x1,x2}, where xi and x2 are the inputs. iii. How much of each input will the firm need in order to produce 20 units electricity in the New Yeti plant? iv. Assume now that Monsters, Inc. decides to produce 40 units of electricity and it can split production in any manner between the two plants. Is the technology available to this firm convex or concave? Explain your answer.
Problem 7-41 Southern Oil Company produces two grades of gasoline: regular and premium. The profit contributions are $0.30 per gallon for regular gasoline and $0.50 per gallon for premium gasoline. Each gallon of regular gasoline contains 0.3 gallons of grade A crude oil and each gallon of premium gasoline contains 0.6 gallons of grade A crude oil. For the next production period, Southern has 18,000 gallons of grade A crude oil available. The refinery used to produce the gasolines has a production capacity of 50,000 gallons for the next production period. Southern Oil's distributors have indicated that demand for the premium gasoline for the next production period will be at most 20,000 gallons. a. Formulate linear programming model that can be used to determine the number of gallons of regular gasoline and the number of gallons of premium gasoline that should be produced in order to maximize tota profit contribution. If required, round your answers to two decimal places. L Let R = P =…
Variable Cells Model Variable Constraints E S D Constraint Number 1 E 2 3 S D S D Name Economy Models Standard Models Deluxe Models Name Total Profit: $ Fan Motors Cooling Coils Manufacturing Time Optimal Solution Constraints Fan motors Cooling coils Final Value 80.000 120.000 0.000 Final Value 200.000 320.000 2080.000 a. Identify the range of optimality for each objective function coefficient. If there is no lower or upper limit, then enter the text "NA" as your answer. If required, round your answers to one decimal place. Objective Coefficient Range Variable lower limit upper limit E Reduced Cost 0.000 0.000 -24.000 Manufacturing time. AUTO Shadow Price 31.000 32.000 0.000 Right-Hand-Side-Range lower limit upper limit Objective Coefficient 63.000 95.000 135.000 b. Suppose the profit for the economy model is increased by $6 per unit, the profit for the standard model is decreased by $2 per unit, and the profit for the deluxe model is increased by $4 per unit. What will the new optimal…