Question

Minimize Z = X1+2X2 Subject to -X1+X2 ? 15 2X1+X2 ? 90 X2 ? 30 And...

Minimize Z = X1+2X2 Subject to -X1+X2 ? 15 2X1+X2 ? 90 X2 ? 30 And X1 ? 0, X2 ? 0 a.) Solve this graphically b.) Develop a table giving each of the CPF solutions and the corresponding defining equations, BF solutions, and non-basic variables.

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

Homework Answers

Answer #1

(a) Solution using graphical method is as under

Optimal solution:

X1 = 15

X2 = 30

Objective value = 75

(b)

Tha table is following

X1 X2 Z Min Optimal Solution
Intersection of C1 and C3 15 30 75 1 Optimal Solution
Intersection of C2 and C3 30 30 90 2
Intersection of C1 and C2 25 40 105 3
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
Solve the following linear programs graphically. Minimize            Z = 6X1 - 3X2 Subject to            2X1 +...
Solve the following linear programs graphically. Minimize            Z = 6X1 - 3X2 Subject to            2X1 + 5X2 ≥ 10                             3X1 + 2X2 ≤ 40                            X1, X2 ≤ 15
Max Z   = 2x1 + 8x2 + 4x3 subject to 2x1 + 3x2 ≤ 8 2x2...
Max Z   = 2x1 + 8x2 + 4x3 subject to 2x1 + 3x2 ≤ 8 2x2 + 5x3 ≤ 12 3x1 + x2 + 4x3   ≤15 and x1,x2,x3≥0; Verify that your primal and dual solutions are indeed optimal using the Complementary Slackness theorem.
Solve the following linear programming model graphically and mathematically. Minimize C = 8x1 + 2x2 Subject...
Solve the following linear programming model graphically and mathematically. Minimize C = 8x1 + 2x2 Subject to 2x1 – 6x2 ≤ 12 5x1 + 4x2 ≥ 40 x1 +2x2 ≥ 12 x2 ≤ 6 x1, x2 ≥ 0
Given a LP model as:Minimize Z = 2X1+ 4X2+ 6X3 Subject to: X1+2X2+ X3≥2 X1–X3≥1 X2+X3=...
Given a LP model as:Minimize Z = 2X1+ 4X2+ 6X3 Subject to: X1+2X2+ X3≥2 X1–X3≥1 X2+X3= 1 2X1+ X2≤3 X2, X3 ≥0, X1 urs a) Find the standard form of the LP problem. b) Find the starting tableau to solve the Primal LP problem by using the M-Technique.
max = x1+3x2 subject to 2x1-2x2<=4 x1-2x2<=2 3x1+2x2>=6 x1 >=0 x2 unrestricted
max = x1+3x2 subject to 2x1-2x2<=4 x1-2x2<=2 3x1+2x2>=6 x1 >=0 x2 unrestricted
Consider the following problem.                         Maximize   Z = 2x1 - x2 + x3, subject to x1...
Consider the following problem.                         Maximize   Z = 2x1 - x2 + x3, subject to x1 - x2 + 3x3 ≤   4             2x1 + x2           ≤ 10             x1 - x2 -    x3 ≤   7 and       x1 ≥ 0,   x2 ≥ 0,    x3 ≥ 0. Use Excel Solver to solve this problem. Write out the augmented form of this problem by introducing slack variables. Work through the simplex method step by step in tabular form to solve the problem.
max Z = 5x1+3x2+x3 s.t : 2x1+x2+x3 < 6 x1+2x2+x3 < 7 x1, x2, x3 >...
max Z = 5x1+3x2+x3 s.t : 2x1+x2+x3 < 6 x1+2x2+x3 < 7 x1, x2, x3 > 0 Solve the problem. What is the optimal value of the objective function (OF)? Decision variables? Solve the problem. What is the optimal value of the objective function (OF)? Decision variables? (20 points)
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.
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...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT