Solve the linear programming problem by using the simplex method Maximize

P=2x1+3x2\quad P=2 x_1+3 x_2

subject to

2x1+x22-2 x_1+x_2 \leq 2

x1+x25-x_1+x_2 \leq 5

x26x_2 \leq 6

x1,x20x_1, x_2 \geq 0


Answered 1 year ago
Answered 1 year ago
Step 1
1 of 10

To turn the i-system into an e-system, add slack variables to the left side of the problem constraint inequalities.

The slack variable ss is the difference between the left and right sides of inequality so if we add it to the left side, the inequality sign becomes a sign of equality.

Create an account to view solutions

Create an account to view solutions

More related questions