Chapter 7: Linear

programming-simplex
Linear program resolution
(PL)
 The graphical method is limited => two variables at max => real
problems have more than two variables (ex:1000 variable and
100 constraints) => must be solved by computer.
 The algebraic resolution of a PL =>is also not effective even for
an acceptable number of variables=> suppose when 5 variables
and 10 constraints=> this will generate 250 coint points possible
to test which is not obvious enough.
 We need a method
 Effective
 Without objective function evaluation for each corner
points
 Computable by computerThe proposed method is simplex.

 The simplex method is an iterative algebraic procedure

that allows to solve a PL.
 Developed in 1947 by Dr. George Dantzig
 This algorithm has helped the military to solve problems
of transport and schedule.
 In 1979, a Soviet scientist named Leonid Khachian
developed a method called the ellipsoid algorithm (which
was supposed to be revolutionary), but it turned out that
it is no better than the simplex method.
Historique

 In 1984, Narendra Karmarkar, a research scientist at AT&T Bell

Laboratories developed the Karmarkar algorithm which proved
to be four times faster than the simplex method for some
problems. But the simplex method always works best for most
problems.
 AT&T Bell Laboratories: It is an American
development and research company owned by Nokia.
 The formulation/
Modelling

linear programming the graphical method

resolution

simplex
 La
formulation/
Modélisation

Programmation La méthode
linéaire graphique

La résolution
Simplexe
principe

 The simplex method uses a very effective approach. It

does not calculate the value of the objective function in
each point; instead, it starts with an angle point of the
feasibility region (allowable solution region) where all
major variables are zero, then moves systematically from
one angle point to another, while improving the value of
the objective function at each step. The process
continues until the optimal solution is found.
Maximisation
With sets of lower or equal constraints
 1 ère étape: Transformation du PL sous forme standard

2nd step: Building the initial simplex table Step 1: Converting the PL to standard format

3rd Step: Choose the variables to be introduced into the database.

4th step: choose the variable to remove from the base

5th Step: determine the pivot

6th Step: Divide the pivot line by the pivot

7th Step: Calculate the values of the table (rectangle rule)

8th Step: Checking the coefficients of the objective function

 Step 1: Transformation of the PL in standard form

Convert the program of the PL form

(canonical-system of inequation)
In standard form (equation system with
Slack variables)
Step 1: Transformation of the PL in standard form
Step 1: Transformation of the PL in standard form
 Step 1: Transformation of the PL in standard form

 At the end of the simplex algorithm run,

the slack variables go represents the
number of resources not used
 2nd step: Building the initial simplex table
based on the standard form

All system variables

Put the coefficients of
each equation with the
corresponding variable

• Each line represents a constraint

• The last line represents the objective function
 2nd step: Building the initial simplex table
based on the standard form

All system variables

Put the coefficients of
each equation with the
corresponding variable
x y e1 e2 e3

3 2 1 0 0

1 0 0 1 0

0 1 0 0 1

30 50 0 0 0
2nd step: Building the initial simplex table
based on the standard form

In the initial table we will propose an initial solution of the set of the feasible
solution from our PL.

Suppose when takes the origin point where x=0 and y=0, The system will give as a
result:
✓e1= 1800
✓e2= 400
✓e3=600
✓Z=0
We will integrate these results in the initial table as follows=>
2nd step: Building the initial simplex table

All system variables

Put the coefficients of
each equation with the
corresponding variable
x y e1 e2 e3

3 2 1 0 0

1 0 0 1 0

0 1 0 0 1

Add the remaining 30 50 0 0 0

variables for the
initial solution.
The base variables
2nd step: Building the initial simplex table
based on the standard form

All system variables

Put the coefficients of
each equation with the
corresponding variable
x y e1 e2 e3

3 2 1 0 0

1 0 0 1 0

0 1 0 0 1

Add the remaining

30 50 0 0 0
variables for the The results of the
initial solution. initial solution
The base variables
2nd step: Building the initial simplex table
based on the standard form
Values outside the base
Values in base Values of the 2nd member
of the constraints

Variable x y e1 e2 e3 Ci

e1 3 2 1 0 0 1800

e2 1 0 0 1 0 400

e3 0 1 0 0 1 600

z 30 50 0 0 0 0
Objective/economic
coefficients
function
 3 Step: Choose the variables to be inserted in the database.

• To increase the value of Z we will choose a variable to increased.

• The choice is made by making sure that this variable will have the greatest possible
value coefficient and will increase the objective function as quickly as possible.

• This selected variable will allow you to select a column that will represent the pivot
column

• The selected variable will call an agreement variable. since which will take a value
after which had none.
3 Step: Choose the variables to be inserted in the base.

Selection of the highest coefficient of the objective function (MAX), Pivot column,

The maximum coefficient of the objective function is 50,

so the variable y that fits into the base.
Pivot column

Variable x y e1 e2 e3 Ci

e1 3 2 1 0 0 1800

e2 1 0 0 1 0 400

e3 0 1 0 0 1 600

z 30 50 0 0 0 0
4 step: choose the variable to remove from the base

Choice of outgoing variable:

The outgoing variable :. Is the the minimum of the ratio of the coefficient
of the right-hand side of each constraint to the corresponding coefficient
of the pivot column when the latter is strictly positive. This line is called
the pivot line.
4 step: choose the variable to remove from the base
• Calculates the ratio: second members/coefficient of the selected variable.
• Retain the MIN
• This value represents => Pivot line
• A quotient that is zero, or a negative number, or has a zero at the denominator, is
ignored.

Variable x y e1 e2 e3 Ci Calcule du
rapport

e1 3 2 1 0 0 1800 1800/2=900

e2 1 0 0 1 0 400 +∞

e3 0 1 0 0 1 600 600/1=600 Pivot line

MIN Value
z 30 50 0 0 0 0
4 step: choose the variable to remove from the base
 Why do we calculate quotients, and why does the smallest quotient identify a line?

 When we choose the variable with a maximum quotient, you try to maximize the result of the
objective function as quickly as possible. But in order not to violate the constraints, we will
have to limit the value of the chosen variable.

 For this, we assume that the other variables except the one chosen are zero and we get the
result of the variable. This is exactly the process of making quotients.

 We choose the min because it will guarantee that the variable will not cover any of the
constraints

 Explanation of the example

 If we assume that x=0; e1=0 and
e2=0;
 Then
 y=1800/2=900
 y=+∞
 Y=600
 The minimum value of y is 600
 If we take 900 the constraint 3 will
be violated
 Variable entering the
base

5 Step: determine the pivot

Pivot column
Output variable from
base

Variable x y e1 e2 e3 Ci

e1 3 2 1 0 0 1800

e2 1 0 0 1 0 400 Pivot line

e3 0 1 0 0 1 600

z 30 50 0 0 0 0
The
pivot
6 Step: Divide the pivot line by the pivot

Variable x y e1 e2 e3 Ci

e1
e2
y 0 1 0 0 1 600

z
• 7 Step: Calculate the values of the table (rectangle rule)

Variable x y e1 e2 e3 Ci

e1 3 2 1 0 0 1800

e2 1 0 0 1 0 400

y 0 1 0 0 1 600

z 30 50 0 0 0 0
• Set a " 0 " for the pivot column

Variable x y e1 e2 e3 Ci

e1 0

e2 0

y 0 1 0 0 1

z
• 7th Step: Calculate the values of the table (rectangle rule)

Variable x y e1 e2 e3 Ci

e1 3 2 1 0 0 1800

e2 1 0 0 1 0 400

y 0 1 0 0 1 600

z 30 50 0 0 0 0

Variable x y e1 e2 e3 Ci

e1 3 0 1 0

e2 1 0 0 1 0 400 • Set a " 0 " for the pivot column

y 0 1 0 0 1 600

z 30 0 0 0
 7th Step: Calculate the values of the table (rectangle rule)

Variable x y e1 e2 e3 Ci

e1 3 2 1 0 0 1800

e2 1 0 0 1 0 400

y 0 1 0 0 1 600

z 30 50 0 0 0 0

Variable x y e1 e2 e3 Ci
0-(2*1/1)=-2
e1 3 0 1 0

e2 1 0 0 1 0

y 0 1 0 0 1 600

z 30 0 0 0
 7th Step: Calculate the values of the table (rectangle rule)

Variable x y e1 e2 e3 Ci

e1 3 2 1 0 0 1800

e2 1 0 0 1 0 400

y 0 1 0 0 1 600

z 30 50 0 0 0 0

Variable x y e1 e2 e3 Ci

e1 3 0 1 0 -2

e2 1 0 0 1 0

y 0 1 0 0 1 600

z 30 0 0 0
 7th Step: Calculate the values of the table (rectangle rule)

Variable x y e1 e2 e3 Ci

e1 3 2 1 0 0 1800

e2 1 0 0 1 0 400

y 0 1 0 0 1 600

z 30 50 0 0 0 0

Variable x y e1 e2 e3 Ci

e1 3 0 1 0 -2

e2 1 0 0 1 0

y 0 1 0 0 1 600
0-(50*1/1)=-50
z 30 0 0 0
 7th Step: Calculate the values of the table (rectangle rule)

Variable x y e1 e2 e3 Ci 1800-(2*600)/1=600

e1 3 2 1 0 0 1800

e2 1 0 0 1 0 400

y 0 1 0 0 1 600

z 30 50 0 0 0 0

Variable x y e1 e2 e3 Ci

e1 3 0 1 0 -2

e2 1 0 0 1 0

y 0 1 0 0 1 600
0-(600*50)/1=-30000
z 30 0 0 0 -50
Variable x y e1 e2 e3 Ci

e1 3 0 1 0 -2 600

e2 1 0 0 1 0 400

Y 0 1 0 0 1 600

z 30 0 0 0 -50 -30000
 Variable x y e1 e2 e3 Ci

e1 3 0 1 0 -2 600

e2 1 0 0 1 0 400

Y 0 1 0 0 1 600

z 30 0 0 0 -50 -30000

This means that we start from the point x=0 and y=0 and z=0We have
the point x=0, y=600 and z=30000With a remainder in the variance
variables of e1= 600 and e2=400
 8th Step: Checking the coefficients of the objective function
Are the coefficients of the economic/objective function zero
or negative?

Yes
We are coming up with the maximum
solution.
No

Perform a new pivot / new pass (Resume

step 3)

Variable x y e1 e2 e3 Ci
In our case we have a positive value which
means that we have not yet reached the e1 3 0 1 0 -2 600
maximum e2 1 0 0 1 0 400

Y 0 1 0 0 1 600

z 30 0 0 0 -50 -30000
 A new pass/iteration (from step 3)

 Step 3: Choose the variables to be inserted in the database. (max last line)

Variable x y e1 e2 e3 Ci Rapport

e1 3 0 1 0 -2 600

e2 1 0 0 1 0 400

y 0 1 0 0 1 600

z 30 0 0 0 -50 -30000
X is the incoming variable
New pass (step 3)

 Step 3: Choose the variables to be inserted in the database. (max last line)
 Step 4: choose the variable to remove from the base (min of the report)

e1 is the output
Variable x y e1 e2 e3 Ci variable
Rapport

e1 3 0 1 0 -2 600 600/3=200

e2 1 0 0 1 0 400 400/1=400

y 0 1 0 0 1 600 /

z 30 0 0 0 -50 -30000
X is the incoming variable
 New pass (step 3)

 Step 3: Choose the variables to be inserted in the database. (max last line)
 Step 4: choose the variable to remove from the base (min of the report)

e1 is the output
Variable x y e1 e2 e3 Ci variable
Rapport

e1 3 0 1 0 -2 600 600/3=200

e2 1 0 0 1 0 400 400/1=400

y 0 1 0 0 1 600 /

The
z 30 0 0 0 -50 -30000
pivot
X is the incoming variable
New pass (step 3)

 Step 6: Divide the line su pivot by the pivot

Variable x y e1 e2 e3 Ci

X 3 0 1 0 -2 600 600/3=200

e2 1 0 0 1 0 400 400

Y 0 1 0 0 1 600 /

z 30 0 0 0 -50 -30000
New pass (step 3)

 Step 6: Divide the pivot line by the pivot

Variable x y e1 e2 e3 Ci

X 1 0 1/3 0 -2/3 600/3=200

e2 1 0 0 1 0 400

Y 0 1 0 0 1 600

z 30 0 0 0 -50 -30000
New pass (step 3)

 Step7: Calculate the values of the table (rectangle rule)

 Set pivot column to zero

Variable x y E1 e2 e3 Ci

X 1 0 1/3 0 -2/3 200

e2 0

Y 0

z 0
 Variable x y e1 e2 e3 Ci

X 3 0 1 0 -2 600

 e2 Calculer les1valeurs du tableau

Étape7: 0 (règle du0rectangle) 1 0 400

 Y la colonne du
Mettre 0 pivot à zéro1 0 0 1 600
 Détecter les lignes et les colonnes qui ne change pas.
z 30 0 0 0 -50 -30000
Variable X y E1 e2 e3 Ci

X 1 0 1/3 0 -2/3 200

e2 0

Y 0

z 0
 Variable x y e1 e2 e3 Ci
Un nouveau
X 3passage0 (étape1 3) 0 -2 600

e2 1 0 0 1 0 400


Y 0 1 0
Étape7: Calculer les valeurs du tableau (règle du rectangle)
0 1 600

 z la remarque
Appliquer 30 de la ligne et
0 colonne qui 0ne change pas0 -50 -30000

Variable X y e1 e2 e3 Ci

X 1 0 1/3 0 -2/3 200

e2 0 0 1

Y 0 1 0 0 1 600

z 0 0 0
 Variable X y e1 e2 e3 Ci
Un nouveau
X 1passage0 (étape
1/33) 0 -2/3 200

e2 0 0 0 1 0 400


Y 0 1 0
Étape7: Calculer les valeurs du tableau (règle du rectangle)
0 1 600

 z la remarque
Appliquer 0 de la ligne et
0 colonne qui0ne change pas0 -50 -30000

Variable X y e1 e2 e3 Ci

X 1 0 1/3 0 -2/3 200

e2 0 0 -1/3 1 2/3 200

Y 0 1 0 0 1 600

z 0 0 -10 0 -30 -36000

Variable X y e1 e2 e3 Ci

X 1 0 1/3 0 -2/3 200

e2 0 0 -1/3 1 2/3 200

Y 0 1 0 0 1 0

z 0 0 -10 0 -30 -36000

 8th step: The coefficients of the objective
function are negative or zero
end of the algorithm
Variable X y e1 e2 e3 Ci

X 1 0 1/3 0 -2/3 200

e2 0 0 -1/3 1 2/3 200

Y 0 1 0 0 1 600

z 0 0 -10 0 -30 -36000

Extraction of results

Variable X y e1 e2 e3 Ci

X 1 0 1/3 0 -2/3 200

e2 0 0 -1/3 1 2/3 200

Y 0 1 0 0 1 600

z 0 0 -10 0 -30 -36000

Z=36 000
X=200
Y=600
e2 is not saturated => there are still 200
e1 and e3 are saturated
Example
 Step 1: Transformation of the PL in
standard form

2nd step:Construct the initial simplex

array

3rd Step: Choose the variables to be

inserted in the database.

4th Step: choose the variable to remove

from the base

5th Step: determine the pivot

6th Step: Divide the line su pivot by the

pivot

7th Step: Calculate the values of the

table (rectangle rule)

8th Step: Checking the coefficients of

the objective function
 Step 1: Transformation of the PL in
standard form

2nd step:Construct the initial simplex

array

3rd Step: Choose the variables to be

inserted in the database.

4th Step: choose the variable to remove Variable x y e1 e2 e3 Ci

from the base
e1 1 3 1 0 0 21
5th Step: determine the pivot
e2 -1 3 0 1 0 18
6th Step: Divide the line su pivot by the
pivot e3 1 -1 0 0 1 5

7th Step: Calculate the values of the z 1 2 0 0 0 0

table (rectangle rule)

8th Step: Checking the coefficients of

the objective function
 Step 1: Transformation of the PL in
standard form

2nd step:Construct the initial simplex

array

3rd Step: Choose the variables to be

inserted in the database.

4th Step: choose the variable to remove Variable x y e1 e2 e3 Ci

from the base
e1 1 3 1 0 0 21
5th Step: determine the pivot
e2 -1 3 0 1 0 18
6th Step: Divide the line su pivot by the
pivot e3 1 -1 0 0 1 5

7th Step: Calculate the values of the z 1 2 0 0 0 0

table (rectangle rule)

8th Step: Checking the coefficients of

the objective function
 Step 1: Transformation of the PL in
standard form

2nd step:Construct the initial simplex

array

3rd Step: Choose the variables to be

inserted in the database.

4th Step: choose the variable to remove Variable x y e1 e2 e3 Ci ratio

from the base
e1 1 3 1 0 0 21 21/3=7
5th Step: determine the pivot
e2 -1 3 0 1 0 18 18/3=6
6th Step: Divide the line su pivot by the
pivot e3 1 -1 0 0 1 5 /

7th Step: Calculate the values of the z 1 2 0 0 0 0

table (rectangle rule)

8th Step: Checking the coefficients of

the objective function Enter y in the base and eliminate e2.
 Step 1: Transformation of the PL in
standard form

2nd step:Construct the initial simplex

array

3rd Step: Choose the variables to be

inserted in the database.

4th Step: choose the variable to remove Variable x y e1 e2 e3 Ci rapport

from the base
e1 1 3 1 0 0 21 21/3=7
5th Step: determine the pivot
e2 -1 3 0 1 0 18 18/3=6
6th Step: Divide the line su pivot by the
pivot e3 1 -1 0 0 1 5 /

7th Step: Calculate the values of the z 1 2 0 0 0 0

table (rectangle rule)

8th Step: Checking the coefficients of

the objective function The pivot is 3
 Step 1: Transformation of the PL in
standard form

2nd step:Construct the initial simplex

array

3rd Step: Choose the variables to be

inserted in the database.
Variable x y e1 e2 e3 Ci
4th Step: choose the variable to remove
from the base e1 1 3 1 0 0 21

5th Step: determine the pivot e2 -1/3 1 0 1/3 0 6

6th Step: Divide the line su pivot by the e3 1 -1 0 0 1 5

pivot
z 1 2 0 0 0 0
7th Step: Calculate the values of the
table (rectangle rule)

8th Step: Checking the coefficients of

the objective function
 Variable x y e1 e2 e3 Ci

e1 1 3 1 0 0 21
Step 1: Transformation of the PL in
standard form e2 -1 3 0 1 0 18

2nd step:Construct the initial simplex e3 1 -1 0 0 1 5

array

3rd Step: Choose the variables to be

z 1 2 0 0 0 0
inserted in the database.
Variable x e2 e1 e2 e3 Ci
4th Step: choose the variable to remove
from the base e1 0 1 0 21

5th Step: determine the pivot y -1/3 1 0 1/3 0 6

6th Step: Divide the line su pivot by the e3 0 0 1 5

pivot
z 0 0 0 0
7th Step: Calculate the values of the
table (rectangle rule)
Zero pivot column
8th Step: Checking the coefficients of Fix rows and columns unchangeable
the objective function
 Variable x y e1 e2 e3 Ci

e1 1 3 1 0 0 21
Step 1: Transformation of the PL in
standard form e2 -1 3 0 1 0 18

2nd step:Construct the initial simplex e3 1 -1 0 0 1 5

array

3rd Step: Choose the variables to be

z 1 2 0 0 0 0
inserted in the database.
Variable x y e1 e2 e3 Ci
4th Step: choose the variable to remove
from the base e1 0 1 0

5th Step: determine the pivot y -1/3 1 0 1/3 0 6

6th Step: Divide the line su pivot by the e3 0 0 1

pivot
z 0 0 0
7th Step: Calculate the values of the
table (rectangle rule)
Yellow cases to be calculated by the rectangular ruler
8th Step: Checking the coefficients of
the objective function
 Variable x y e1 e2 e3 Ci

e1 1 3 1 0 0 21
Step 1: Transformation of the PL in
standard form e2 -1 3 0 1 0 18

2nd step:Construct the initial simplex e3 1 -1 0 0 1 5

array

3rd Step: Choose the variables to be

z 1 2 0 0 0 0
inserted in the database.
Variable x y E1 e2 e3 Ci
4th Step: choose the variable to remove
from the base e1 2 0 1 -1 0 3

5th Step: determine the pivot y -1/3 1 0 1/3 0 6

6th Step: Divide the line su pivot by the e3 2/3 0 0 1/3 1 11

pivot
z 5/3 0 0 -2/3 0 -12
7th Step: Calculate the values of the
table (rectangle rule)

8th Step: Checking the coefficients of Calculates the remainder of the number by the rectangular ruler
the objective function
 Step 1: Transformation of the PL in
standard form

2nd step:Construct the initial simplex

array Variable x y e1 e2 e3 Ci
3rd Step: Choose the variables to be
inserted in the database.
e1 2 0 1 -1 0 3

4th Step: choose the variable to remove y -1/3 1 0 1/3 0 6

from the base
e3 2/3 0 0 1/3 1 11
5th Step: determine the pivot
z 5/3 0 0 -2/3 0 -12
6th Step: Divide the line su pivot by the
pivot
End of 1st iteration
7th Step: Calculate the values of the
table (rectangle rule)

8th Step: Checking the coefficients of

the objective function
Variable x y e1 e2 e3 Ci

e1 2 0 1 -1 0 3

y -1/3 1 0 1/3 0 6

e3 2/3 0 0 1/3 1 11

z 5/3 0 0 -2/3 0 -12

End of 1st iteration

 Variable x y e1 e2 e3 Ci

e1 2 0 1 -1 0 3
Step 1: Transformation of the PL in
standard form y -1/3 1 0 1/3 0 6
2nd step:Construct the initial simplex
array
e3 2/3 0 0 1/3 1 11

3rd Step: Choose the variables to be z 5/3 0 0 -2/3 0 -12

inserted in the database.

4th Step: choose the variable to remove Are the coefficients of the economic/objective function zero
from the base or negative?

5th Step: determine the pivot

Yes
6th Step: Divide the line su pivot by the We are getting to the maximum solution
pivot

7th Step: Calculate the values of the •.

table (rectangle rule) No

8th Step: Checking the coefficients of • Perform a new pivot / new pass (Resume step 3)
the objective function
 Step 1: Transformation of the PL in
standard form

2nd step:Construct the initial simplex Variable x e2 e1 e2 e3 Ci

array

3rd Step: Choose the variables to be e1 2 0 1 -1 0 3

inserted in the database.
y -1/3 1 0 1/3 0 6
4th Step: choose the variable to remove
from the base
e3 2/3 0 0 1/3 1 11
5th Step: determine the pivot z 5/3 0 0 -2/3 0 -12
6th Step: Divide the line su pivot by the There are still positive valuesStart a new iteration (one
pivot
new pass from step 3)
7th Step: Calculate the values of the
table (rectangle rule)

8th Step: Checking the coefficients of

the objective function
Iteration 2

Variable x y e1 e2 e3 Ci

e1 2 0 1 -1 0 3

y -1/3 1 0 1/3 0 6

e3 2/3 0 0 1/3 1 11

z 5/3 0 0 -2/3 0 -12

Enter x in the base and remove e1. pivot is 2

End of Iteration 2

Variable x y e1 e2 e3 Ci

x 1 0 ½ -1/2 0 3/2

y 0 1 1/6 1/6 0 13/2

e3 0 0 -1/3 2/3 1 10

z 0 0 -5/6 1/6 0 -29/2

Enter x in the base and remove e1. pivot is 2

Iteration 3

Variable x y e1 e2 e3 Ci

X 1 0 ½ -1/2 0 3/2

y 0 1 1/6 1/6 0 13/2

e3 0 0 -1/3 2/3 1 10

z 0 0 -5/6 1/6 0 29/2

Enter e2 in the base and eliminate e3. pivot is 2/3

End of iteration 3

Variable x y e1 e3 e3 Ci

x 1 0 1/4 0 0 9

Y 0 1 1/4 0 -1/4 4

e2 0 0 -1/2 1 3/2 15

Z 0 0 -3/4 0 -1/4 -17

 End of iteration 3
Program end
Variable x y e1 e3 e3 Ci

x 1 0 1/4 0 0 9

Y 0 1 1/4 0 -1/4 4

e2 0 0 -1/2 1 3/2 15

Z 0 0 -3/4 0 -1/4 -17

The optimum is z=17

X=9
y=4
e2= 15
Problem of agriculture
Problem of agriculture: solution

Base x y e1 e2 e3 e4 ci
X 1 0 4/3 0 -1/3 0 40
e2 0 0 -14/3 1 2/3 0 60
Y 0 1 -1/3 0 1/3 0 110
e4 0 0 -4/3 0 1/3 1 50
Z 0 0 -200/3 0 -100/3 0 -26000

The maximum solution is Z = 26000

X= 40, Y= 110, e1= 0, e2= 60, e3= 0, e4= 50

Exemple 3

 Maximize the objective function

 z = 1200 x1 + 1000 x2
under economic constraints
 3 x1 + 4x2 <= 160
 6 x1 + 3 x2 <= 180
 x1 >= 0 ; x2 >= 0
Base X Y e1 e2 R
Y 0 1 2/5 -1/5 28
X 1 0 -1/5 4/15 16
Z 0 0 -160 -120 -47200

The maximum solution is: Z = 47200

X = 16, Y= 28, e1= 0, e2= 0