Question: Simplex method Objective function: maximize z= 3x +5y Constraints (linear): 2x + y 10 x + 3y 12 Non-Negative Constraints: x 0 y 0 The
Simplex method
Objective function: maximize z= 3x +5y
Constraints (linear):
2x + y 10
x + 3y 12
Non-Negative Constraints:
x 0
y 0
The standard form is:
Maximize z = 3x + 5y + Os1 + Os2
Subject to constraints:
2x + y +s1 = 10
x + 3y + s2 = 12
x, y, s1, s2 0
x | y | s1 | s2 | Right Hand Side |
| 2 | 1 | 1 | 0 | 10 |
| 1 | 3 | 0 | 1 | 12 |
| ... | ... | ... | ... | ... |
| -3 | -5 | 0 | 0 | 0 |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
