Find Initial Basic Feasible Solution:Plant€123Demand(i)(ii) Least Cost MethodNorth-West Corner MethodA84480Vogel's Approximation MethodB1462090WarehouseC748120D11610160Supply100200150

The following values of the cost of shipping from the three plants to four warehouses are provided.…

Answered: Find Initial Basic Feasible Solution:…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter7: Nonlinear Optimization Models

Section: Chapter Questions

Problem 49P: If a monopolist produces q units, she can charge 400 4q dollars per unit. The variable cost is 60...

See similar textbooks

Similar questions

Based on the following sensitivity analysis, which of the following products would be considered most sensitive to changes or errors in the objective function coefficient? Variable Cells Cell Name Final Value Reduced Cost Objective Coefficient AllowableIncrease AllowableDecrease $B$2 Product_1 0 −2 25 11 4 $B$3 Product_2 175 0 25 12 14 $B$4 Product_3 0 −1.5 25 8 5 Constraints Cell Name Final Value Shadow Price Constraint R.H.Side AllowableIncrease AllowableDecrease $H$9 Resource_A 0 0 100 1E+30 100 $H$10 Resource_B 525 0 800 1E+30 275 $H$11 Resource_C 700 1.75 700 366.6666667 700 multiple choice Product_1 Product_2 Product_3
Based on the following sensitivity analysis, which of the following products would be considered most sensitive to changes or errors in the objective function coefficient? Variable Cells Cell Name Final Value Reduced Cost Objective Coefficient AllowableIncrease AllowableDecrease $B$2 Product_1 0 −2 25 10 5 $B$3 Product_2 175 0 25 10 14 $B$4 Product_3 0 −1.5 25 8 6 Constraints Cell Name Final Value Shadow Price Constraint R.H.Side AllowableIncrease AllowableDecrease $H$9 Resource_A 0 0 100 1E+30 100 $H$10 Resource_B 525 0 800 1E+30 275 $H$11 Resource_C 700 1.75 700 366.6666667 700 Choose the product Product 1 Product 2 Product 3
A decision problem has the following three constraints: 70X + 6Y <= 420; 24X + 3Y= 72; and 11X - Y <= 14 . The objective function is Min 17X + 38Y . The objective function value is : a. 338 b. 676 c. unbounded d. infeasible e. 0
Consider the following linear programming model: maximize Z = 3x1 + 2x2 subject to : x1 +x2 ≤ 1 x1 + x2 ≥ 2 x1,x2 ≥ 0 a) Write this model in a standard (augmented) form. (i.e. Introduce slack/surplus, artificial etc.)b) Constract the initial simplex tableau and carry on your calculations to solve this model using the simplex method. Interpret your result.
Maximize z= 5R+8P Subject to R+3/2P≤900 1/2R+1/3P≤300 1/8R+1/4P≤100 R,P ≥ 0 non-binding constraint: R+(3/2) P≤900 binding constraints: (1/8) R+(1/4) P≤100 and (1/2) R+(1/3) P≤300 redundant constraint R+(3/2) P≤900 1. What is the range of the coeficient, c1, of the decision variable R that will make the optimal solution remain unchange? a. 13/3≤c1≤7 b. 10/3≤c1≤10 c. 4≤c1≤12 d. 13/2≤c1≤19/2 2. What is the range of the coeficient, c2, of the decision variable P that will make the optimal solution remain unchange? a. 13/3≤c1≤7 b. 10/3≤c1≤10 c. 4≤c1≤12 d. 13/2≤c1≤19/2
Consider the following LP problem: Min 6X+ 27Y Subject to : 2 X + 9Y => 25, and X + Y <= 75. Pick a suitable statement for this problem: a. X=37.5, Y=37.5 is the only optimal solution. b. Optimal Obj. function value is 75 c. X = 0, Y = 0 is the only optimal solution. d. Optimal Obj. function value is 0
Optimal solution 4T+3C=240 2T+1C=100 →T=30, C-40 Can you please explain to me the solution and way of how he did get the exact coordinate points in the graph? I know there is a formula or way to calculate since it is hard to find out the exact point when manually plotting a graph
Given the following information for a product-mix problem with three products and three resources. Primal Decision Variables: x1 = number of unit 1 produced; x2 = # of unit 2 produced; x3 = # of unit 3 produced Primal Formulation:Dual Formulation: Max Z (Rev.) = 25x1 + 30x2 + 20x3Min W = 50π1+ 20π2+25π3 Subject To8x1+ 6x2+ x3≤ 50(Res. 1 constraint)Subject To8π1+ 4π2+2π3≥ 25 4x1+ 2x2+ 3x3≤ 20(Res. 2 constraint)6π1+ 2π2+π3 ≥ 30 2x1+ x2+ 2x3≤ 25(Res. 3 constraint)π1+ 3π2+2π3≥ 20 x1, x2, x3≥ 0 (Nonnegativity)π1, π2, π3 ≥ 0 Optimal Solution: Optimal Z = Revenue = $268.75 x1 = 0 (Number of unit 1)Dual Var. Optimal Value = 22.5 (Surplus variable in 1st dual constraint) x2 = 8.125 (Number of unit 2)Dual Var. Optimal Value = 0 (Surplus variable in 2nd dual constraint) x3 = 1.25 (Number of unit 3)Dual Var. Optimal Value = 0 (Surplus variable in 3rd dual constraint) Resource Constraints: Resource 1 = 0 leftover…
Only Construct Linear Programming Model for the following Problemb; An individual wishes to invest $9000 over the next year in two typar of inventrent linvestment A yinlds 5% and invertment � yields 8%. Market retearch rocotnenends an allocs tion of at least 25% in A and at most 30% in �. Motsover, investment in A should be at least ball the invertmeut in �. How should the fund be allocated to the two imetrinents?
Based on the following sensitivity analysis, which of the following products would be considered most sensitive to changes or errors in the objective function coefficient? A. Product_2 B. Product_1 C. Product_3 Variable Cells Cell Name Final Value Reduced Cost Objective Coefficient AllowableIncrease AllowableDecrease $B$2 Product_1 0 −2 25 13 5 $B$3 Product_2 175 0 25 8 9 $B$4 Product_3 0 −1.5 25 11 3 Constraints Cell Name Final Value Shadow Price Constraint R.H.Side AllowableIncrease AllowableDecrease $H$9 Resource_A 0 0 100 1E+30 100 $H$10 Resource_B 525 0 800 1E+30 275 $H$11 Resource_C 700 1.75 700 366.6666667 700
Given the linear program Max 3x+4y S.T. -x+2y</=8 x+2y</=12 2x+y</= 16 x,y>/=0 A. Write the problem in standard form. Identify slack/surplus variables. B. Find all the extreme points. List the value for x and y at each extreme point. C. What is the optimal solution? D. What are the values of the slack/surplus variables at the optimal solution?
Four proposals are being considered with investment and NPW shown below. C can only beconsidered if B is implemented. B and D and E are mutually exclusive. The budget is $80.A B C D EInvestment $10 $20 $30 $40 $50NPW $34 $28 $20 $16 $32a) Formulate this as a 0-1 integer program (objective function and constraints).b) Use trial and error to find all feasible solutions, and indicate which is optimal.c) Set up this problem in Excel, and use Solver to find the same optimal solution

SEE MORE QUESTIONS

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

SEE MORE TEXTBOOKS

Find Initial Basic Feasible Solution: (i) (ii) Plant 1 2 3 Demand A84 А 4 80 North-West Corner Method Least Cost Method Vogel's Approximation Method B 14 6 20 90 Warehouse C 7 4 8 120 D 1 16 10 160 Supply 100 200 150