Question

Consider the following linear program: MIN Z = 60A + 50B s.t. 10A + 20B ≤...

Consider the following linear program: MIN Z = 60A + 50B

s.t. 10A + 20B ≤ 200

8A + 5B ≤ 80

A≥2

B≥5

Solve this linear program graphically and determine the optimal quantities of A, B, and the value of Z using iso-profit method.

Homework Answers

Answer #1

Given,

subject to,

The contraints are shown graphically below:

The feasible region is the area bound by the points shown on the graph.

Now the isoprofit line represented by is drawn on the graph and shown below:

We see that the isoprofit line passes through point (2,5). This gives the minimum value of Z

Hence, A= 2, B=5 and minimum value of Z is

Min Z = 60 x 2 + 50 x 5 = 120 + 250 = 370

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Consider the following linear program: MIN Z = 60A + 50B s.t. 10A + 20B ≤...
Consider the following linear program: MIN Z = 60A + 50B s.t. 10A + 20B ≤ 200 8A + 5B ≤ 80 A≥2 B≥5 Solve this linear program graphically and determine the optimal quantities of A, B, and the value of Z using enumeration method.
Consider the following linear program: MIN Z = 50A + 60B s.t. 6A + 8B ≤...
Consider the following linear program: MIN Z = 50A + 60B s.t. 6A + 8B ≤ 300 14A + 7B ≥ 196 A ≥ 10 B ≥ 8 Solve this linear program graphically and determine the optimal quantities of A, B, and the value of Z. Show the optimal area.
Consider the following mixed-integer linear program. Max     3x1 + 4x2 s.t. 4x1 + 7x2 ≤ 28...
Consider the following mixed-integer linear program. Max     3x1 + 4x2 s.t. 4x1 + 7x2 ≤ 28 8x1 + 5x2 ≤ 40 x1, x2 ≥ and x1 integer (c) Find the optimal solution for the mixed-integer linear program. (Round your answers to three decimal places, when necessary.)
Solve the following linear program using the simplex method: MAX 5X1 + 5X2 + 24X3 s.t....
Solve the following linear program using the simplex method: MAX 5X1 + 5X2 + 24X3 s.t. 15X1 + 4X2 + 12X3 <= 2800 15X1 + 8X2 <= 6000 X1 + 8X3 <= 1200 X1, X2, X3 >= 0
Consider the following LP Min Z = 4X1+X2 s.t. 3X1+X2=3 4X1+3X2>=6 X1+X2<=4 X1 , X2 >=...
Consider the following LP Min Z = 4X1+X2 s.t. 3X1+X2=3 4X1+3X2>=6 X1+X2<=4 X1 , X2 >= 0 a) Put the problem into standard form, using slack, excess, and artificial variables. b) Identify the initial BV and NBV along with their values. c) Modify the objective function using an M, a large positive number. d) Apply the Big M method to find the optimal solution
Consider the following program Min Z=-x1-x2 s.t 2x1+x2≤10 -x1+2x2≤10 X1, x2≥0 Suppose that the vector c=...
Consider the following program Min Z=-x1-x2 s.t 2x1+x2≤10 -x1+2x2≤10 X1, x2≥0 Suppose that the vector c= {-1,-1} is replaced by (-1,-1) +ʎ (2, 3) where ʎ is a real number Find optimal solutions for all values of ʎ      Z     X1      X2     S1   S2    RhS     Z      1      0       0    -0.6    -0.2     -8    X1      0      1       0     0.4    -0.2     10    X2     ...
Consider the following program Min Z=-x1-x2 s.t 2x1+x2≤10 -x1+2x2≤10 X1, x2≥0 Suppose that the vector c=...
Consider the following program Min Z=-x1-x2 s.t 2x1+x2≤10 -x1+2x2≤10 X1, x2≥0 Suppose that the vector c= {-1,-1} is replaced by (-1,-1) +ʎ (2, 3) where ʎ is a real number Find optimal solutions for all values of ʎ      Z     X1      X2     S1     S2    RhS     Z      1      0       0    -0.6    -0.2     -8    X1      0      1       0     0.4    -0.2      2    X2...
Consider the following linear program: Max 3A + 2B s.t 1A + 1B 10 3A +...
Consider the following linear program: Max 3A + 2B s.t 1A + 1B 10 3A + 1B < 24 1A + 2 B < 16 A, B > 0
Consider the following linear program: Max profit 8X + 4Y Subject to: 4X + 3Y ≤...
Consider the following linear program: Max profit 8X + 4Y Subject to: 4X + 3Y ≤ 480 2X + 3Y ≤ 360 X,Y ≥ 0 Use the corner point solution method to solve this linear program. The followings must be included in your answer: a) defined decision variables. b)a graph with constraints lines. c)highlighted feasible region. d)specified coordinates and profit for each corner point. e)specified optimal values of X and Y and optimal profit.
Solve the following LP model using the corner point method. Min 4X_1+5X_2 S.T. X_1+2X_2?80 3X_1+X_2?75 X_1,X_2?0...
Solve the following LP model using the corner point method. Min 4X_1+5X_2 S.T. X_1+2X_2?80 3X_1+X_2?75 X_1,X_2?0 List all the corner points and provide the optimal solution for full credit.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT