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.

Chapter7: Nonlinear Optimization Models

Section7.7: Portfolio Optimization Models

Problem 41P

See similar textbooks

Similar questions

If a monopolist produces q units, she can charge 400 4q dollars per unit. The variable cost is 60 per unit. a. How can the monopolist maximize her profit? b. If the monopolist must pay a sales tax of 5% of the selling price per unit, will she increase or decrease production (relative to the situation with no sales tax)? c. Continuing part b, use SolverTable to see how a change in the sales tax affects the optimal solution. Let the sales tax vary from 0% to 8% in increments of 0.5%.
Kelson Sporting Equipment, Inc., makes two different types of baseball gloves: a regular model and a catcher's model. Letting R = number of regular gloves C = number of catcher's mitts leads to the following formulation: Max 6R + 9C s.t. R + 3 2 C ≤ 1,000 Cutting and sewing 1 2 R + 1 3 C ≤ 300 Finishing 1 8 R + 1 4 C ≤ 100 Packaging and shipping R, C ≥ 0 The computer solution is shown below. Optimal Objective Value = 4350.00000 Variable Value Reduced Cost R 500.00000 0.00000 C 150.00000 0.00000 Constraint Slack/Surplus Dual Value 1 275.00000 0.00000 2 0.00000 4.50000 3 0.00000 30.00000 Variable ObjectiveCoefficient AllowableIncrease AllowableDecrease R 6.00000 7.50000 1.50000 C 9.00000 3.00000 5.00000 Constraint RHSValue AllowableIncrease AllowableDecrease 1 1000.00000 Infinite 275.00000 2 300.00000 100.00000 166.66667 3…
Find the minimum value of the function z=2x+2y subject to the following constraints. x≤17 y≤16 5x+2y≥42 3x+11y≥84
Kelson Sporting Equipment, Inc., makes two different types of baseball gloves: a regular model and a catcher's model. Letting R = number of regular gloves C = number of catcher's mitts leads to the following formulation: Max 5R + 8C s.t. R + 3 2 C ≤ 800 Cutting and sewing 1 2 R + 1 3 C ≤ 240 Finishing 1 8 R + 1 4 C ≤ 100 Packaging and shipping R, C ≥ 0 The computer solution is shown below. Optimal Objective Value = 3520.00000 Variable Value Reduced Cost R 320.00000 0.00000 C 240.00000 0.00000 Constraint Slack/Surplus Dual Value 1 120.00000 0.00000 2 0.00000 3.00000 3 0.00000 28.00000 Variable ObjectiveCoefficient AllowableIncrease AllowableDecrease R 5.00000 7.00000 1.00000 C 8.00000 2.00000 4.66667 Constraint RHSValue AllowableIncrease AllowableDecrease 1 800.00000 Infinite 120.00000 2 240.00000 160.00000 106.66667 3…
1.) Objective Function: Maximize Z = 60X₁ +50X₂ Subject to Assembly 4X₁ + 10X ₂ ≤ 100 hours Inspection 2X₁ + 1X₂ ≤ 22 hours Storage 3X ₁ + 3X₂ ≤ 39 cubic feet X₁, X₂ ≤ 0Solve the following completely by graphical method:a) corner point methodb) iso profit line 2.) Suppose, 240 acres of land available.Profit: $40/acres corn: $30/acre oats Have 320 hours of labor available.Corn takes 2 hours of labor per acre of land; however, Oats requires 1 hour of labor per acre of land. Problem: How many acres of each should be planted to maximize profit? a) Formulate the problem.b) Solve the problem using graphical method (corner point solution) and Iso profit method.
Suppose we are solving a maximization problem andthe variable xr is about to leave the basis.a What is the coefficient of xr in the current row 0?b Show that after the current pivot is performed, thecoefficient of xr in row 0 cannot be less than zero.c Explain why a variable that has left the basis on agiven pivot cannot re-enter the basis on the next pivot.
Use the simplex method to maximize the given function. Assume all variables are nonnegative. Maximize f = 7x + 14y + 4z subject to the following. 3x + 5y + 4z ≤ 30 3x + 2y ≤ 4 x + 2y ≤ 8 (x,y,z)= f=
INCORRECT FORFormulate a linear programming model that can be used to determine the pounds of Brazilian Natural and Colombian Mild that will maximize the total contribution to profit. (Let BR = pounds of Brazilian beans purchased to produce Regular, BD = pounds of Brazilian beans purchased to produce DeCaf, CR = pounds of Colombian beans purchased to produce Regular, and CD = pounds of Colombian beans purchased to produce DeCaf.) Max 2.033BR+2.582BD+1.868CR+2.418CD INCORRECT Pounds of Regular BR+CR≤900 INCORRECT Pounds of DeCaf BD+CD≤400 INCORRECT
Based on Kolesar and Blum (1973). Suppose that a company must service customers lying in an area of A square miles with n warehouses. Kolesar and Blum showed that when the warehouse(s) are located properly, the average distance between a warehouse and a customer is (A/n)1/2. Assume that it costs the company $60,000 per year to maintain a warehouse and $400,000 to build a warehouse. Also, assume that a $400,000 building cost is equivalent to incurring a cost of $40,000 per year indefinitely. The company fills 160,000 orders per year, and the shipping cost per order is $1 per mile. If the company serves an area of 100 square miles, how many warehouses should it have?
Show the complete Linear Programming Model. Show solutions (i.e. decision variables, objective function, subject to constraints, etc.) Q. A gold processor has two sources of gold ore, source A and source B. In order to keep his plant running, at least three tons of ore must be processed each day. Ore from source A costs $1,000 per ton to process, and ore from source B costs $500 per ton to process. Costs must be kept to less than $4,000 per day. Moreover, Government Regulations require that the amount of ore from source B cannot exceed twice the amount of ore from source A. If ore from source A yields 2 oz. of gold per ton, and ore from source B yields 3 oz. of gold per ton, how many tons of ore from both sources must be processed each day to maximize the amount of gold extracted subject to the above constraints? Formulate the LP model.
Suppose a company must service customers lying inan area of A sq mi with n warehouses. Kolesar and Blumhave shown that the average distance between a warehouseand a customer is An Assume that it costs the company $60,000 per year tomaintain a warehouse and $400,000 to build a warehouse.(Assume that a $400,000 cost is equivalent to foreverincurring a cost of $40,000 per year.) The company fills160,000 orders per year, and the shipping cost per order is$1 per mile. If the company serves an area of 100 sq mi,then how many warehouses should it have?
Consider the linear program max 4y_{1} + 5y_{2} s.t. - y_{1} + y_{2} <= 4 y_{1} - y_{2} <= 10 y_{1}, y_{2} >= 0 (a) Show graphically that the model is unbounded.