1 Use the simplex algorithm to solve the Giapetto problem (Example 1 in Chapter 3).

Giapetto Woodcarving, Inc., manufactures two types of wooden toys: soldiers and trains. A soldier sells for $27 and uses $10 worth
of raw materials. Each soldier that is manufactured increases Giapettos variable labor and overhead costs by $14. A train sells for
$21 and uses $9 worth of raw materials. Each train built increases Giapetto variable labor and overhead costs by $10. The
manufacture of wooden soldiers and trains requires two types of skilled labor: carpentry and finishing. A soldier requires 2 hours of
finishing labor and 1 hour of carpentry labor. A train requires 1 hour of finishing and 1 hour of carpentry labor. Each week, Giapetto
can obtain all the needed raw material but only 100 finishing hours and 80 carpentry hours. Demand for trains is unlimited, but at
most 40 soldiers are bought each week. Giapetto wants to maximize weekly profit (revenues _ costs). Formulate a mathematical
model of Giapettos situation that can be used to maximize Giapettos weekly profit.
Solution:
Objective Function: max z= 3x1+2x2
2x1+x2<= 100
x1+x2<=80
x1<=40,
x1,x2 >= 0
Converting LP to standard form:
Z-3x1-2x2=0
2x1+x2+s1=100
x1+x2+s2=80
x1+s3=40
Canonical Form:
Row

x1

x2

s1

s2

s3

rhs

bfs

-3

-2

Z=0

100

S1=1
00

ratio

50

80

40

Row
0
1
2
3

Z
1
0
0
0

x2
-2
1
1
0

s1
0
1
0
0

s2
0
0
1
0

80

s3
0
0
0
1

rhs
0
100
80
40

40

ratio
50
80
40

X1enteringvariable in row 3

Eros
Row 0=3(row3)+row0
row 1=row 1- 2row3
row 2=row 2- row3

Row
0
1
2
3

Z
1
0
0
0

x1
0
0
0
1

x2
-2
1
1
0

s1
0
1
0
0

s2
0
0
1
0

s3
3
-2
-1
1

rhs
120
20
40
40

ratio

Eros
Row 0=row0+2row 1

Row
0
1
2
3

Z
1
0
0
0

x1
0
0
0
1

x2
0
1
0
0

s1
2
1
-1
0

s2
0
0
1
0

s3
-1
-2
1
1

rhs
160
20
20
40

ratio

Row
0
1
2
3

Z
1
0
0
0

x1
0
0
0
1

x2
0
1
0
0

s1
1
-1
-1
1

s2
1
2
1
-1

s3
0
0
1
0

rhs
180
60
20
20

ratio

row 1=row 2- row1

Eros
row 0=row 0+row 2
row1=row 1+2row 2
row 3=row 3-row 2

z=180,

x1
-3
2
1
1

S2=8
0
S3=4
0

z=180,

x2=60

s3=20

x1=20

s1,s2=0

20
40

20
40

X2 enteringvariable in row 1

s3enteringvariable in row 2

Optimal

LP to Standard Form:
z-2x1-3x2=0
x1+2x2+s1=6
2x1+x2+s2=8
Canonical Form:
Row
0
1
2

10.67
1.33

Z
1
0
0

x1
-2
1
2

x2
-3
2
1

s1
0
1
0

s2
0
0
1

rhs
0
6
8

ratio
3
8

X2 enteringvariable in row1

Eros
Row 0=row0+row1*3
row 1=row 1 *0.5
row 2=row 2- row1

Row
0
1
2

Z
1
0
0

x1
-0.5
0.5
1.5

x2
0
1
0

s1
1.5
0.5
-0.5

s2
0
0
1

rhs
9
3
5

ratio

Eros
Row 0=row0*2+row 2
row 1=row 1*2-row2
row 2=row 2/1.5

Row
0
1
2

Z
1.00
0.00
0.00

x1
0.00
0.00
1.00

x2
0.00
1.00
0.00

s1
1.33
0.67
-0.33

s2
0.33
-0.33
0.67

rhs
10.67
1.33
3.33

ratio

z=
32/3

x2=
4/3

x=1
10/3

s1,s2=
0

6
3.3

X1enteringvariable in row 2

Optimal

3.Use the simplex algorithm to solve the following problem:

LP to Standard Form:
z-2x1+x2-x3=0
3x1+x2+x3+s1=60
x1-x2+2x3+s2=10
x1+x2-x3+s3=20
Canonical Form:
Row
0
1
2
3

Z
1
0
0
0

Eros
Row 0=row0+2*row2
row 1=row 1- 3row2

x1
-2
3
1
1

x2
1
1
-1
1

x3
-1
1
2
-1

s1
0
1
0
0

s2
0
0
1
0

s3
0
0
0
1

rhs
0
60
10
20

ratio
20
10
20

X1 enteringvariable in row 2

Z
1
0
0
0

x1
0
0
1
0

x2
-1
4
-1
2

x3
3
-5
2
-3

s1
0
1
0
0

s2
2
-3
1
-1

s3
0
0
0
1

rhs
20
30
10
10

ratio

row 3=row 3- row2

Row
0
1
2
3

Eros
Row 0=row0+row3
row 1=row 1- 4row3
row 2=row 2+row 3
row 3=row 3/2

Row
0
1
2
3

Z
1
0
0
0

x1
0
0
1
0

x2
0
0
0
1

X3
1.5
1
0.5
-1.5

s1
0
1
0
0

s2
1.5
-1
0.5
-0.5

s3
0.5
-2
0.5
0.5

rhs
25
10
15
5

ratio

z=25; x1=15, x2=5, s1=10, x3=s2=s3=0

7.5
5

X2 enteringvariable in row 3

7.5
Optimal
5

4.
optimal solution to minz = (-)maxz
-max(z)= -2x1+5x2
Converting LP to standard Form:
-Z+2x1-5x2=0
3x1+8x2+s1=12
2x1+3x2+s2=6
Canonical Form:
Row
0
1
2

-Z
1
0
0

Eros
Row 0=row0+row1*5
row 1=row 1/8
row 2=row 2- 3*row1

x1
2
3
2
Row
0
1
2

x2
-5
8
3
-Z
1.00
0
0.00

x1
3.88
0
0.88

s1
0
1
0
x2
0.00
1
0.00

s2
0
0
1
s1
0.63
0
-0.38

rhs
0
12
6
s2
0.00
0
1.00

Optimal Solution for max(z) is (-)Z=7.5,x1=0,x2=1.5,s1=0,s2=1.5

But for Optimal Solution for min(z) is Z=-7.5,x1=0, x2= 1.5,s1=0,s2=1.5

ratio
1.5
2
rhs
7.50
1.50
1.50

X2 enteringvariable in row1

ratio
Optimal

5. Suppose that in solving an LP, we obtain the tableau in Table 22. Although x1 can enter the basis, this LP is
unbounded. why?

Solution: Considering Maximizing the given LP:

Eros

z
1
0
0

x1
-3
1
2

x2
-2
-1
0

x3
0
1
0

x4
0
0
1

rhs
0
3
4

ratio

x1
0
1
0

x2
-5
-1
2

x3
3
1
-2

x4
0
0
1

rhs
0
0
4

ratio

Row 2=row 2-2*row1

z
1
0
0

Eros
Row 0=row 0+5*row2
Row 1=row 1+row 2
Row 2=row 2/2

z
1
0
0

x1
0
1
0

x2
5
0
1

x3
-7
0
-1

x4
5
0.5
0.5

rhs
20
2
2

Eros
Row 0=row 0+3*row1

0.33
0.50

X1enteringvariable in row 1

(3/-1) None
2.00
X2enteringvariable in row 2
ratio
(2/0) None Ratio Test isFailed,So LP is
(2/-1) None
unbounded

Concept: An unbounded LP for a max problem occurs when a variable with a negative
coefficient in row 0 has a nonpositive coefficient in each constraint.

6. Suppose we have obtained the tableau in Table 75 fora maximization problem. State conditions on a1, a2, a3,
b,c1, and c2 that are required to make the following statements true:
i)
ii)
iii)
iv)
v)

The current solution is optimal, and there are alternative optimal Solutions
The current basic solution is not a basic feasible solution
The current basic solution is a degenerate bfs.
The current basic solution is feasible, but the LP is unbounded
The current basic solution is feasible, but the objective function value can be improved by replacing x6
as a basic variable with x1.

Answer:
i)

Case (1): b>=0, c1>=0,c2=0,a1>0,then x2 can be entering variable- Optimal Solution Can be
obtained.
Case (2): b>=0,c2>=0,c1=0,then x1 can be entering variable- Optimal Solution Can be obtained.
Case (3): b>=0, c1,c2>=0,a2>0then x5 can be entering variable- Optimal Solution Can be
obtained.
ii) (b<0)
iii) (b=0)
iv) Case (1) if x2 is entering variable, a1<=0, c2<0 ,b>=0 ; Case (2) if x5 is entering variable, a2<=0
,b>=0

v)

c1<0 and 3/a3<=b/4