Solve the following linear program using both the graphical and the simplex methods: Max 2X1 +...

Solve the following linear program using both the graphical and the simplex methods:

Max	2X1	+ 8 X2
s.t.
	3X1	+ 9X2	<=	15
	2X1	+ X2	>=	12
	X1, X2		>=	0

Show graphically how the simplex method moves from one basic feasible solution to another. Find the coordinates of all extreme points of the feasible region.

From the graphic I can see there's no solution , but how to prove it through simplex method? Thank you!

Solutions

Expert Solution

orchestra answered 1 year ago

Next > < Previous

Related Solutions

Solve the following linear program using the graphical solution procedure. Max 5A + 5B s.t 1A...

Solve the following linear program using the graphical solution procedure. Max 5A + 5B s.t 1A <100 1B<80 2A+4B<400 A,B>0

2. Solve the following linear program using the graphical solution procedure: Max 8A + 5B s.t....

2. Solve the following linear program using the graphical solution procedure: Max 8A + 5B s.t. i. 1A ≤ 120 ii. 1B ≤ 150 iii. 2A + 4B ≤ 700 iv. A, B ≥ 0

Solve the following linear programming problem using the dual simplex method: max ? = −?1 −...

Solve the following linear programming problem using the dual simplex method: max ? = −?1 − 2?2 s.t. −2?1 + 7?2 ≤ 6 −3?1 + ?2 ≤ −1 9?1 − 4?2 ≤ 6 ?1 − ?2 ≤ 1 7?1 − 3?2 ≤ 6 −5?1 + 2?2 ≤ −3 ?1,?2 ≥ 0

Solve the following linear programming problem using generalised simplex method Maximise z= 2x1+3x2 subject to -2x1+x2>=3...

Solve the following linear programming problem using generalised simplex method Maximise z= 2x1+3x2 subject to -2x1+x2>=3 3x1+x2<=5 x1,x2>=0

Maximization by the simplex method Solve the following linear programming problems using the simplex method. 1>....

Maximization by the simplex method Solve the following linear programming problems using the simplex method. 1>. Maximize z = x1 + 2x2 + 3x3 subject to x1 + x2 + x3 ≤ 12 2x1 + x2 + 3x3 ≤ 18 x1, x2, x3 ≥ 0 2>. A farmer has 100 acres of land on which she plans to grow wheat and corn. Each acre of wheat requires 4 hours of labor and $20 of capital, and each acre of corn...

Solve the following linear programming model graphically: Max Z= 3x1 +4x2 Subject to: 2x1 + 4x2...

Solve the following linear programming model graphically: Max Z= 3x1 +4x2 Subject to: 2x1 + 4x2 <= 22 -x1 + 4x2 <= 10 4x1 – 2x2 <= 14 x1 – 3x2 <= 1 x1, x2, >=0 Clearly identify the feasible region, YOUR iso-profit line and the optimal solution (that is, d.v. values and O.F. Value.

[6.4] Solve the following linear program by a graphical method: Maximize 3x1 + 3x2 + 21x3...

[6.4] Solve the following linear program by a graphical method: Maximize 3x1 + 3x2 + 21x3 subject to 6x1 + 9x2 + 25x3 <= 15 3x1 + 2x2 + 25x3 <= 20 x1 , x2 , x3 >= 0 (Hint: utilize the dual problem.)

Use the Simplex method to solve the following LP minimize −2x1 −3x2 + x3 + 12x4...

Use the Simplex method to solve the following LP minimize −2x1 −3x2 + x3 + 12x4 subject to −2x1 −9x2 + x3+ 9x4 + x5 = 0 1/3x1 + x2 −1/3x3 −2x4 + x6 = 0 x1,x2,x3,x4,x5,x6 ≥ 0

Solve the following problem using both graphical method and Simplex tableau Maximize f(x,y)=5x+4y subject to 3x+5y<=180...

Solve the following problem using both graphical method and Simplex tableau Maximize f(x,y)=5x+4y subject to 3x+5y<=180 where 28 => x => 0 and 30=> y=>0

Construct the Dual and solve the Dual by the graphical and simplex method. Minimize Z =...

Construct the Dual and solve the Dual by the graphical and simplex method. Minimize Z = 1x1 + 2x2 + 3x3 Subject to: 0x1 + 6x2 + 2x3 >= J 3x1 + 2x3 + 5x3 >= K x1, x2, and x3 >= 0 constant resources: J = 25 K = 24 Please do on paper...

Subjects