Question

Consider the following LP problem: Minimize Cost = 3x1 + 2x2 s.t. 1x1 + 2x2 ≤...

Consider the following LP problem:

Minimize Cost = 3x1 + 2x2

s.t.

1x1 + 2x2 ≤ 12

2x1 + 3 x2 = 12

2 x1 + x2 ≥ 8

x1≥ 0,

x2 ≥ 0

What is the optimal solution of this LP?

(0,8)(12,0)(4,0)(0,4)(2,3)(0,6)(3,2)

I NEED SOLUTION!

Business   Operations-Management   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

The constraint equations are plotted on graph as shown below:

The red shaded region (left of red line) indicates the first constraint, and the green shaded region (right of green line) indicates the third constraint. The overlapping region is in our consideration.

Now, the blue line indicates the second (equality) constraint.

Hence, the feasible solutions lie along the blue line between the points (3,2) and (6,0)

Value of objective function at (3,2) = 3x3 + 2x2 = 13

Value of objective function at (6,0) = 3x6 + 2x0 = 18

Minimum value is at (3,2).

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Consider the following LP problem:           Max   3X1 + 2X2           s.t. 5X1 + 4X2 £...
Consider the following LP problem:           Max   3X1 + 2X2           s.t. 5X1 + 4X2 £ 40                 3X1 + 5X2 £ 30                 3X1 + 3X2 £ 30                        2X2 £ 10                 X1 ³ 0, X2 ³ 0 (1)   Show each constraint and the feasible region by graphs. Indicate the feasible region clearly.   (5 points) (2)   Are there any redundant constraints? If so, what constraint(s) is redundant? (2 points) (3)   Identify the optimal point on your graph. What...
Consider the following LP: Max Z=X1+5X2+3X3 s.t. X1+2X2+X3=3 2X1-X2 =4 X1,X2,X3≥0 a.) Write the associated dual...
Consider the following LP: Max Z=X1+5X2+3X3 s.t. X1+2X2+X3=3 2X1-X2 =4 X1,X2,X3≥0 a.) Write the associated dual model b.) Given the information that the optimal basic variables are X1 and X3, determine the associated optimal dual solution.
Solve The LP problem using the graphic method Z Max=15X1+10X2 Constaint function: 3X1 + 2X2 ≤...
Solve The LP problem using the graphic method Z Max=15X1+10X2 Constaint function: 3X1 + 2X2 ≤ 80 2X1 + 3X2 ≤ 70 X1≥ 0 , X2≥0
Problem 11-1 (a) Indicate whether the following linear program is an all-integer linear program or a...
Problem 11-1 (a) Indicate whether the following linear program is an all-integer linear program or a mixed-integer linear program. Max 30x1 + 25x2 s.t. 3x1 + 1.5x2 ≤ 400 1.5x1 + 2x2 ≤ 250 1x1 + 1x2 ≤ 150 x1, x2 ≥ 0 and x2 integer This is a mixed-integer linear program. Write the LP Relaxation for the problem but do not attempt to solve. If required, round your answers to one decimal place. Its LP Relaxation is Max x1...
3) Find the dual of the following LP: Max 4x1 - x2 s.t. 2x1 + 3x2...
3) Find the dual of the following LP: Max 4x1 - x2 s.t. 2x1 + 3x2 ≥ 10 x1 – x2 = 4 0.5x1 + 2x2 ≤ 20 x1 ≥ 0, x2 unconstrained Please provide an excel solution to this problem
Solve the LP problem using graphical method. Determine the optimal values of the decision variables and...
Solve the LP problem using graphical method. Determine the optimal values of the decision variables and compute the objective function. Minimize Z = 2x1 + 3x2 Subject to             4x1 + 2x2 ≥ 20             2x1 + 6x2 ≥ 18               x1 + 2x2 ≤ 12 x1, x2  ≥ 0 with solution! thak you so much :D
Duality Theory: Consider the following LP: max 2x1+2x2+4x3 x1−2x2+2x3≤−1 3x1−2x2+4x3≤−3 x1,x2,x3≤0 Formulate a dual of this...
Duality Theory: Consider the following LP: max 2x1+2x2+4x3 x1−2x2+2x3≤−1 3x1−2x2+4x3≤−3 x1,x2,x3≤0 Formulate a dual of this linear program. Select all the correct objective function and constraints 1. min −y1−3y2 2. min −y1−3y2 3. y1+3y2≤2 4. −2y1−2y2≤2 5. 2y1+4y2≤4 6. y1,y2≤0
Indicate whether the following linear program is an all-integer linear program or a mixed-integer linear program....
Indicate whether the following linear program is an all-integer linear program or a mixed-integer linear program. Max 30x1 + 23x2 s.t. 3x1 + 1.7x2 ≤ 410 1.1x1 + 3x2 ≤ 260 1x1 + 1x2 ≤ 145 x1, x2 ≥ 0 and x2 integer This is a  linear program. Write the LP Relaxation for the problem but do not attempt to solve. If required, round your answers to one decimal place. Its LP Relaxation is: Max x1 + x2 s.t. x1 +...
Find the duals of the following LP: max z = 4x1 - x2 + 2x3 s.t....
Find the duals of the following LP: max z = 4x1 - x2 + 2x3 s.t. x1 + x2 <= 5 2x1 + x2 <= 7 2x2 + x3 >= 6 x1 + x3 = 4 x1 >=0, x2, x3 urs show steps
Consider the problem max 4x1 + 2x2 s.t. x1 + 3x2 ≤ 5 (K) 2x1 +...
Consider the problem max 4x1 + 2x2 s.t. x1 + 3x2 ≤ 5 (K) 2x1 + 8x2 ≤ 12 (N) x1 ≥ 0, x2 ≥ 0 and the following possible market equilibria: i) x1 = 0, x2 = 3/2, pK = 0, pN = 1/4, ii) x1 = 1, x2 = 2, pK = 2, pN = 1, iii) x1 = 1, x2 = 2, pK = 4, pN = 0, iv) x1 = 5, x2 = 0, pK =...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT