Example 1:

Max Z=3x1+2x2+4x3
x1+2x2+5x3 ≤ 20 (1)
-3x1 + 4x2 ≤ 10 (2)
x1,x2,x3 ≥ 0
Standard form
Max Z=3x1+2x2+4x3
x1+2x2+5x3+s1 = 20 (1)
-3x1 + 4x2 + s2 = 10 (2)
x1,x2,x3,s1,s2 ≥ 0
Finding BFS0:
Set the original variables to zero
BFS0=(0,0,0,20,10)
Basic variables: s1, s2
Remark: Z=c.x=cB.xB+cN.xN=cB.xB (since xN=0)
Example 2 :
Max Z = x1 + 3 x2
x1 + 2 x2  2 (1)
- x1 + 2 x2  4 (2)
x1 , x2  0
Standard form:
Max Z = x1 + 3 x2
x1 + 2 x2 +s1 = 2 (1)
- x1 + 2 x2 - s2= 4 (2)
x1 , x2 ,s1,s2  0
Finding BFS0:
Setting the original variables to zero
BFS0=(0,0,2,-4) (infeasible solution!!!)
The Artificial Linear Program
(LPA): Min ZA = a2
x1 + 2 x2 +s1 = 2 (1)
- x1+2 x2-s2+a2=4 (2)
x1 , x2 ,s1,s2,a2  0
By setting x1=x2=0, we get: s1=2,s2=0,a2=4
BFS0=(0,0,2,0,4)
Adding artificial variables solves the starting
solution issue. However, a feasible solution of
(LPA) is also feasible for the original LP if and
only if all the artificial variables are equal to
zero. In other words, finding a feasible solution
for the original LP turns out to finding a feasible
solution of LPA but with a2=0.
Example 3:
Max Z=3x1+2x2+4x3
x1+2x2+5x3 ≤ 20 (1)
-3x1 + 4x2 ≥ 10 (2)
x1,x2,x3 ≥ 0
Artificial LP
Min ZA=a2 (or equivalently Max ZA=-a2)
x1+2x2+5x3+s1 = 20 (1)
-3x1 + 4x2 - s2 + a2 = 10 (2)
x1,x2,x3,s1,s2,a2 ≥ 0
BFS0=(0,0,0,20,0,10)