SOLUTION: Maximize the following objective function using simplex method: Z=10 X_(1 )+8 X_2 Subject To: 3 X_1+1X_2 ≤4500 2 X_1+2X_2 ≤4000 X_1+3X_2 ≤4500

Algebra.Com
Question 1032382: Maximize the following objective function using simplex method:
Z=10 X_(1 )+8 X_2
Subject To:
3 X_1+1X_2 ≤4500
2 X_1+2X_2 ≤4000
X_1+3X_2 ≤4500
With
X_1 ≥0
X_2 ≥0
Answer by johb(2)   (Show Source): You can put this solution on YOUR website!
This is really easy to solve using Simplex method:
The optimal solution value is Z = 18500
X1 = 1250
X2 = 750
You can learn more in http://www.phpsimplex.com/en
There is a free tool to solve any problem step-by-step via Simplex method, Dual-Simplex method and Graphical method.

RELATED QUESTIONS

The following maximum problem is in standard form. Introduce slack variables and set up... (answered by Edwin McCravy)
Hello, I need solution for below sums. 1) Z=40x + 35y subject to 2x + 3y<=60, 4x + 3y... (answered by Fombitz)
Solve the following linear programming problems using simplex method. Maximize Z =... (answered by ikleyn)
Solve the following linear programming problems using simplex method. Maximize Z =... (answered by ikleyn)
Maximize P = 3x + 2y
subject to
  2x + y ≤ 18
2x + 3y  ≤ 42
 3x + y   (answered by Edwin McCravy)

Solve the following linear programming problem using the corner-point method.
Maximize:... (answered by Fombitz)

Primal Problem:
maximize profit P = 40x + 30y
constraints:
1.	x + y <= 240
2.	2x + y... (answered by Edwin McCravy,AnlytcPhil)

Maximization 
Maximize p = 7x - 4y subject to
y >= 2x - 8
y <= 10 - x
y <= (x + 8) /... (answered by mathie123,Edwin McCravy)

Maximize P=3x+y+3z
Subject to 2x+y+z≦2
          x+2y+3z≦5... (answered by Edwin McCravy)