The revised Simplex

method

Ha Thi Xuan Chi, PhD

1
Outline chapter > diary

Introduction of ( large problem

re÷sÉ
q the

Table form
Matrix
←
form If
I can't programming
pporogramming@ftwar.e
)
Matrix
form

2
Revised Simplex
Solving for Basic Feasible Solution

• The n nonbasic variables from the n+m elements

of are set to zero.
éxù
[A, I]ê ú = b
ëx s û

éxù
êx ú ³ 0
ë sû

3
Revised Simplex
Solving for Basic Feasible Solution

✓
• The set of m equations with m basic variables denoted by
☐ BxB=b

where é xB1 ù éxù

ê ú êx ú
Vector of basic variables xB= ê xB 2 ú obtained by eliminating the nonbasic variables from
-

êë xBm úû
ë sû
é B11 B12 B1m ù
êB obtained by eliminating the columns corresponding to
Basis matrix B = B2 m úú
coefficient of nonbasic variables from [A, I]
-
ê 21 B22
êë Bm1 Bm 2 Bmm úû .
b
B-1BxB=B-1b B. R, =

• To solve BxB = b both side are premultiplied by B-

1
or xB=B-1b B- ! B. xp = B- ! b
Z = cBxB= cBB-1b

;b_B
then
k us .

E-G-45-93.BE?lb# 4
 Revised Simplex
Solving for Basic Feasible Solution
He Kz
$1B 5×24*35
q Max Z = 3x1 + 5x2 é1 0 1 0 0ù
q s.t: x1 + *,
q ✗at
≤4
2x2 ≤ 12 =
= ê
[ A, I ] = ê0 2 0 1 0ú
êë3 2 0 0 1úû
ú
µ
q Xst 3x1 + 2x2 = ≤ 18 I
1¥ é4ù
q x1, x2 ≥ 0 é x3 ù ê ú
êx ú b = 12
ê ú
é x1 ù xs =
ê 4ú êë18 úû
In this case x=
êx ú $
êë x5 úû
ë 2û
T slack
c = [3, 5]
decision
.

n
rang
objeticoegjuint vars
5
 2 = C.
B. TUB =
E. 0,010] Ekzika ,R5)
Max 2- = 3m -15×2 -10.0K$ -10.0*1*-10.0*5
St : Mt 0×2 + -3 4 =

2×2 t ✗a = 12

3×1 1- 2Rzt ✗5=-18

initial solution : 1^89%51 '¥;) :[ %)

✗
3=4
KEY
✗ 1=0 Basic
1*-12
¥-0
Von Basic
1 Xz
✗ 5=18
☒ar
a-

2-

[ ¥1;-)
=
②
2- = so 95 -

✗
3
✗
q Xs

13=-1100
: : : ) b=[&z )
Book = b
,
Revised Simplex Solving for Basic Feasible
Solution
RB = B- ?b =

↳ Iea t →
Ks t
• Iteration é1 0 0ù é x3 ù é1 0 0ù é 4 ù é 4 ù
ê ú ê ú
0 = ê0 1 0úú =B-1 s
êx ú = êê0 1 0úú✗ ê12 ú = ê12 ú
B ê ê 4ú

Ft êë0 0 1úû êë x5 úû êë0 0 1úû êë18 úû êë18úû *

o
é4ù 2
é x3 ù
êx ú
Basic coefficient Z = [0, 0, 0] ê12 ú
ê ú =0
of constraints
ê 4ú êë18 úû
xB = êë x5 úû p
Basie

cB =
A
vars

↳ nuns
[0, 0, 0] ,
2 =
G.
13-1%-7 =
0

Basic vars
objective coefficient of
6
Revised Simplex Solving for Basic
Feasible Solution
• Iteration 1

4=000
é x3 ù
xB = ê ú
ê x2 ú
B
4.
é
④ as
D
1 0 0
= êê0 2 0úú
ù
B-1
é1 0 0ù
= êê0 1 / 2 0úú
B=[q § )
êë x5 úû êë0 2 1úû êë0 - 1 1úû
BLUT
•
4-
On Ines
cB = [0, 5, 0]

, é 4ù
é x3 ù é1 0 0ù é 4 ù
ê ú ê ú ê12 ú = ê6ú
so x2 = 0 1 / 2 0 ê ú ê ú

MEI
ê ú ê ú
êë x5 úû êë0 - 1 1úû êë18 úû êë6úû
BB = IIIb é4ù
ê6 ú
so Z = [0, 5, 0]
ê ú = 30
êë6 úû
2- = ↳✗↳ = 30

7
?⃝
Revised Simplex Solving for Basic
Feasible Solution

4-
• Iteration 2
% R2 Ry M3 = B- ! b
é4ù é 2ù
é1 0 1ù é1 1 / 3 - 1 / 3ù é x3 ù é1

D=
é x3 ù 1/ 3 - 1 / 3ù
xB = ê ú B = êê0 2 0úú B-1 = ê0 1 / 2 ú so ê x ú = êê0 1/ 2 0 úú 12 = êê6úú
ê ú
ê x2 ú > ê 0 ú ê 2 ú ê0 ê ú
- 1 / 3 1 / 3 úû
êëg
x1 úû êë0 2 3úû êë0 - 1 / 3 1 / 3 úû êë x1 úû ë ë û êë2úû
ê18 ú
cB = [0, 5, 3] 0
é2ù
ê ú
so ê6 ú = 36
Z = [0, 5, 3] ✗ 0
kg kg ✗ I êë 2 úû
0
2 =
↳ x kg = 36
optional
2

the optimal as =
6 2
Nr = My =

solution 8
Matrix Notation
Maximize Z= cx é a11 a12 L a1n ù
Matrix:
êa a22 L a2 n úú
subject to A = ê 21
Ax = b êL L L L ú
x³0 ê ú
ë am1 am 2 L amn û

The constrains become:

Row vector: c = [ c1 , c2 ,..., cn ]
Column vectors: éx ù éx ù
[ A, I ] ê x ú = b êx ú ³ 0
éb1 ù é xn +1 ù ë sû ë sû
é x1 ù é0 ù
êx ú êb ú ê0 ú êx ú
x = ê 2ú b = ê 2ú 0=ê ú xs = ê n + 2 ú
ê…ú ê…ú ê…ú ê… ú
ê ú ê ú ê ú ê ú
ë xn û ëbn û ë0 û ë xn + m û

9
Simplex tableaux in matrix form

Basic Z Coefficient of: RHS 93

variable Rt Original 5,52Slack 53

}
Rz ?
CB
update
=
variable "3 variable .

1
Z row 1 cB .B-1 .A - c cB .B-1 cB .B-1 .b B B-
\

xB 0 B-1 .A B-1 B-1 .b

:}
A

cB : vector whose elements are the objective six

function coefficients (including zero for slack variables)

=/ §;)
for the corresponding elements of xB
xB : vector of basic variables RB
B : basis matrix
B-1 : inverse of basis matrix
B : vector of RHS
10
 standard form
Max 2- = 3M -17kt 2k, y
2) Initial solution
St : -2g -12kg -1kg £10
Basic
Non
3) Basic
34 + Ry -
se
, £ 20

Let de =°
NBV
Max 2- = 3M -17%1-2%+05 ,
-10.52
10
rz=O|
REO
-

St : -2g +2kg -1kg + s,

=

2° 10
/ Bv
Sa
3g
=
+ sea -

kg + Si =

52=20
 Si S2 04 Xz
4) % Rz Rz Rg

14 g) 0=[37-2]
0

[
-
2 2 1

#1I= 3 y -

y o
I B
:r¥s
=

b
= I :o)

[
% § ]
CB =

variables
43=1%1 : Basic

13=1 :& ] is ii.

:-[ ] §
 Khakis
Iteration 1

c=[001ft ? / f } ? ! ] [37-2]=-1-3-7 ]
-

G. B- ! A -

IT
%)
"

↳ •
B- 1=1-00 ][f 9) =
to entering
Xg
]
43.13-1.6=[003%9] .[%) =[ 0 0

14 R2 V3

-1-3711=[-37+4]
St
B- 1. A = -181*00 ] .

leaving

=[ÉÑ minrastio
:(E)
'
B-
20
B- :b =
If 9) [%) =L :] sat
preparation for Iterations
% Rz Rz Si S2 04 Kz peg

[-22 1%9] -1372 ]

^
c=

#/I= 3 1 -

l
A I = B

b
= [ %) :
Rts ☒as Sa
]

%=ÉI" %:-[
[ 7 0

[ 0 0 ] BB•=
CB =

¥1
1

1 Xz S2

=/ §• :/ 9) Bi:[9 :)
-

B.
0
B. =L :
 [ -3 0 -2 ]
Iter 2 : =

g. B-I!
2
A - c
[7-0]/9 %)
=
T TI ¥372B -

CB; ?
B =
[7-0]/9 %) = to 7 ]

CB :B ? -
b
[7-0]/9 %) [ %) =

BEA =L? :) I ;] =
-1-23 ^^
0 -1
]
1
B- 2

:b
13 =
[9%1118] =
1%-1
Max 2- =
Body -15K£ -1223-1041-0521-03
€10
St M + 222 + s,
€40
:

+ sz
&
a 1- 5kg 1- kg
€ 20
M -13kg + Sg
M , 2,3 70 , Si 2,320
, "
1) c
l 93 , 043 , A, B ,
B ,
B

Nonbvmitialsolu.li#cB--
entering
[É
µ=OSz-
:÷ :
war

É %]
, leaving var

c=[is§ E) 9 Basic rang

 " "

=/ I ?
! ij! [§ ÷ : y
*
a-
,
①

b- -

(Eg )
B-
:[: 891
93 B- !
.
A -
C =
[ 000 ]
[§ § §) (& § %) (
-

]
352

= E-I -Ñ-Ñ_ entering

 [§ § 8,1
'

↳
B- =
[ ooo ] =
to 00
]

G. B- ! b
[§ § §) (Yg )
= -1000] = 0

is :$ =L ! 8114%1 -1¥:) =

B-!A
=L! 88,111 ÷ ;) ÷÷ .
=
3 7 I
 leaving ( smallest)

=\ "É¥|sa
s, →
-

Rt Nz R}
Ratio

,[ § ? !1)
A =
5
% Ss
% S3
[¥
↳
e
=

=
[É
[ si
É É]
EL EI
↳
-
,
=

✗z Sz Sz
,
!
Bisi:& :] =L :]
O
B. : .

0 I
0
 " I ]
µ
-

'

93 BI ,
A- C
,

Cos
,
.
B ?
? b

Bit .
A
Simplex tableaux in matrix form
Example
"
543=[8%8] : update
←
Maximize Z = 3x1 + 5x2
Basic Maximize Z = 3x1 + 5x2 +0=1+01+05-3

(
.

Subject to Subject to

*:
x1 ≤4 x1 + s1 =4
2x2 ≤ 12
ii. 2x2 + s2 = 12

tax
3x1 + 2x2 ≤ 18 3x1 + 2x2 + s3 = 18
. -

x1 ≥0
x2 ≥ 0. x1≥ 0, x2 ≥ 0, s1 ≥0, s2 ≥0, s3 ≥0.

é4 ù
94 Ka

é1 0 ù ,
si sa s,
%=µ¥)
of
, ,
,

g, , ,

=/
,, ,

c = [3, 5] b = êê12 úú [ A ] = êê0 2úú I 0 1 Leta -0

Rz=O
update 0
fix êë 3 2 úû
O
êë18 úû y
①
NBV
11
 (÷:)
9=4
1133
Simplex tableaux in matrix form
Iteration 0 Initial solution
4=04
/
Basic variables Basis matrix O
51 Sz Sz My =

12
52 =

é s1 ù é1 0 0 ù se, =
0
18
xB = êê s2 úú B = êê0 1 0 úú I § =

NBV BV
êë0 0 1 úû
-

êë s3 úû
The coefficients of basic variables (s1, s2, s3) in constraints
The coefficient of basic variables (s1, s2, s3) in objective function
-

s Sir 53
,

CB = [ 0 0 0] é1 0 0 ù
B -1 = êê0 1 0 úú
êë0 0 1 úû

12
Simplex tableaux in matrix form
The coefficients of non basic variables (x1, x2) in constraints
é1 0 0 ù é1 0 ù é1 0 ù
-1 ê ú ê ú ê
B . A = ê0 1 0 ú ê0 2 ú = ê0 2 ú V ú
êë0 0 1 úû êë3 2 úû êë3 2 úû
(3×3) (3×2) (3×2)
The coefficients of basic variables (s1, s2, s3) in constraints +15

é1 0 0 ù é 4 ù é 4 ù
B -1.b = êê0 1 0 úú êê12úú = êê12úú ✓
êë0 0 1 ûú êë18úû êë18úû
13
Simplex tableaux in matrix form

The coefficients of the basis variables (s1, s2, s3) in objective function
Z
- row
é1 0 0 ù 51 Sz 53
ê ú
cB .B = [ 0 0 0] ê0 1 0 ú = [ 0 0 0]
-1

êë0 0 1 úû

14
Initial Table ( -3 5)

÷÷¥÷:↳÷ ÷÷¥
c
-

- =

'

,
as
É_F¥±YD
 1=1 A A $
A. B- =
B update
-

Simplex tableaux in matrix form

The coefficients of the non basic variables (x1, x2) in objective function
Z row
é1 0 ù
-

M R2

cB .B -1. A - c = [ 0 0 0] êê0 2 úú - [3 5] = [ -3 - 5]
êë 3 2 ûú
Negative

é4 ù Solution is not optimal

Z = cB .B -1.b = [ 0 0 0] êê12 úú = 0
êë18 úû
-

15
Simplex tableaux in matrix form
Determine the entering variable :

Selecting the variable whose the coefficient value is the

most negative (maximize problem) and the positive

coefficient (minimize problem) in Z-eq.

The coefficients of the nonbasic variables (x1, x2):

cB .B -1. A - c = [ 0, 0] - [3,5] = [ -3, -5]

The most negative

x2 : entering variable
16
Simplex tableaux in matrix form
Determine the leaving variable:
Basic Z Coefficient of: RHS
variable Original Slack
variable variable
Z 1 000
c .B .A - c
B
-1 c .B c .B .b B
-1
B
-1

xB 0 0
B-1 .A 00
B B .b
-1 -1

q Entering variable is the original variable:

Selecting the minimum ratio: B-1 .b/B-1 .A

q Entering variable is the slack variable

Selecting the minimum ratio: B-1 .b/ B-1

17
Simplex tableaux in matrix form
x2 : entering variable and original variable
R2
SI Sz Sz H R2 24

é1 0 0 ù é1 0 ù é1 0 ù
B -1. A = êê0 1 0 úú êê0 2 úú = êê0 2 úú
êë0 0 1 úû êë3 2 úû êë3 2 úû
é4 ù
Coefficient values of x2
s ê- ú
undefined
o
: .

ê ú
,

ê 12 ú 86 smallest
Min ratio = =4
é1 0 0 ù é 4 ù é 4 ù Sz ê 2 ú
ê 8 ú s2 : leaving variable
B -1.b = êê0 1 0 úú êê12úú = êê12úú Sgtê ú
ë2 û
êë0 0 1 ûú êë18úû êë18úû
18
 Simplex tableaux in matrix form s, ¥7s ,
Iteration 1 Sz
Basic variables
é s1 ù
Basis
si ✗
matrix
as }
é1 0 0 ù [ If § §)
11
ê ú Sz→ a
xB = ê x2 ú B = êê0 2 0 úú B-
←
êë s3 úû êë0 2 1 úû
☒ matrix A

The coefficient of basic variables (s1, x2, s3) in objective function

cB = [ 0 5 0 ]
The coefficients of basic variables (s1, x2, s3) in constraints
✗
S 253
f
, é1 0 0 ù
ê 1 ú
B -1 = ê0 0ú
CB = [O O O ] ê 2 ú
ê0 -1 1 ú
Sn Sz Sz ,
ë û 19
Simplex tableaux in matrix form
The coefficients of non basic variables (x1, s2) in constraints
é1 0 0 ù
ê ú é1 0 ù é1 0 ù
-1
ê 1 ú ê ú ê ú
B .A = 0 0 ê0 2 ú = ê0 -1ú
ê 2 ú
ê0 -1 1 ú êë 3 2 úû êë 3 0 úû
ë û
The coefficients of basic variables (s1, x2, s3) in constraints

é1 0 0 ù
ê ú é4 ù é4ù
1
-1
ê
B .b = 0 0 ú êê12 úú = êê6 úú
ê 2 ú
ê0 -1 1 ú êë18 úû êë6 úû
ë û 20
Simplex tableaux in matrix form

The coefficients of the basis variables (s1, x2, s3) in objective function

é1 0 0 ù
ê ú
1 é 5 ù
cB .B = [ 0 5 0] 0
-1
ê ú
0 = ê0 0ú
ê 2 ú ë 2 û
ê0 -1 1 ú
ë û

21
Simplex tableaux in matrix form

The coefficients of the non basic variables (x1, s2) in objective function
é1 0 ù My R2
é 5 ùê
-1
cB .B . A - c = ê0 0 ú ê0 2 úú - [3 5] = [ -3 5]
-

row
ë 2 û
êë 3 2 úû

Negative i.
entering
é4 ù
-1 é 5 ùê ú Solution is not optimal
Z = cB .B .b = ê0 0 ú ê12 ú = 30
ë 2 û
êë18 úû

22
Simplex tableaux in matrix form

Determine the entering variable :

The coefficients of the non basic variables (x1, s2) in objective function
é1 0 ù
é 5 ùê ú
-1
cB .B . A - c = ê0 0 ú ê0 2 ú - [3 5] = [ -3 5]
ë 2 û
êë 3 2 úû
The most negative
x1 : entering variable

23
Simplex tableaux in matrix form
Determine the leaving variable:
Basic Z Coefficient of: RHS
variable Original Slack
variable variable
Z 1 cB .B-1 .A - c cB .B-1 cB .B-1 .b

xB 0 B-1 .A B-1 B-1 .b

q If the entering variable is the original variable

Selecting the minimum ratio: B-1 .b/B-1 .A

q If the entering variable is the slack variable

Selecting the minimum ratio: B-1 .b/ B-1

24
Simplex tableaux in matrix form
NZ
é1 0 0 ù ( x2 : entering variable and original variable

ê ú é1 0 ù é1 0 ù
1
-1
ê
B .A = 0 0 ú êê0 2 úú = êê0 1 úú
ê 2 ú
ê0 -1 1 ú êë 3 2 úû êë 3 0 úû
ë û
RHS
é1 0 0 ù Coefficient values of x1

ê ú é4 ù é 4ù
1
-1
ê
B .b = 0 0 ú êê12 úú = êê 6 úú é4ù
ê 2 ú
ê0 -1 1 ú êë18 úû êë 6 úû ê1ú
ê ú
ë û Min ratio = - = 2 ê ú
ê6ú s3 : leaving variable
← Sz ê ú
ë3û 25
Simplex tableaux in matrix form

Iteration 2

Basic variables Basis matrix

Si Kim
é s1 ù é1 0 1 ù
ê
xB = ê x2 ú ú B = êê0 2 0 úú
êë x1 úû êë0 2 3úû

26
Simplex tableaux in matrix form

The coefficient of basic variables (s1, x2, x1) in objective function

Sp Xz Rl
cB = [ 0 5 3]
The coefficients of basic variables (s1, x2, x1) in constraints
é -1 ù
ê 1 0
3ú
ê ú
1
B -1 = ê0 0ú
ê 2 ú
ê ú
ê0 -1 1 ú
êë 3 úû

27
Simplex tableaux in matrix form

The coefficients of non basic variables (s1, s2) in constraints

é -1 ù
ê1 0 3 ú
ê ú é1 0 ù é 0 0 ù
1
-1 ê
B .A = 0 0 ú êê0 2 úú = êê0 1 úú
ê 2 ú
ê ú êë 3 2 úû êë1 0 úû
ê0 -1 1 ú
êë 3 úû

28
Simplex tableaux in matrix form

The coefficients of basic variables (s1, x2, x1) in constraints

é -1 ù
ê1 0 3 ú
ê ú é4 ù é2ù
1
-1 ê
B .b = 0 0 ú êê12 úú = êê6 úú
ê 2 ú
ê ú êë18 úû êë 2 úû
ê0 -1 1 ú
êë 3 úû

29
Simplex tableaux in matrix form
The coefficients of the basis variables (s1, x2, x1) in objective function

é -1 ù
ê1 0 3 ú
ê ú
ê 1 ú é 3 ù
cB .B = [ 0 5 3] 0
-1
0 = ê0 1ú
ê ú
ê
2
1
ú
ë 2 û non -

negative
ê0 -1 ú
êë 3 úû
Doto
Positive

30
Simplex tableaux in matrix form

The coefficients of the non basic variables (s1, s2) in objective function
é1 0 ù
ê ú
cB .B . A - c = [ 0 5 3] ê0 2 ú - [3 5] = [ 0 0]
-1
-
non -

negative
êë 3 2 úû

é4 ù Almog
Positive
é 3 ùê ú
-1
Z = cB .B .b = ê0 1ú ê12 ú = 36 Max3Mt5a=Z

(
ë 2 û •

EG
êë18 úû St :
M & Sa
Solution is optimal = 12+1-1*-85
2h2 -152
-153=18
3Rd -1 Erez
31
 Fundamental Insight I
Initial Z Decision variables Slack variables RHS
Table
Z x1 x2 s1 s2 s3 rhs

1 -3 -5 0 0 0 0 2- = 36
t = -c 0
0 1 0 1 0 0 4 -2 = 36
,

T =
0 0
A
2 0 1
I
0 12
b 2-2=37.5
0 3 2 0 0 1 18
2-3=37

}
0
1 -c 0 0 ☐Z ,
t =
=

T 0 A
-1
I b
-1 -1
↳ 11-2-2=1.5
☐ 2-3=1
1 cb B A - c cb B cb B b
=
0
-
B -1 A B -1 B -1b Foundations-32
 Fundamental Insight
2--2-1=03/2
Final Z Decision variables Slack variables rhs Z -2-2=1
Table
Z x1 x2 s1 s2 s3 Rhs
t* = 1 0 z*-c 0 @
0 3/2 y* 1 shadow
36 Z*
→
0 0 0 1 1/3 -1/3 2 price
T* = 0 0 A* 1 0 ½ S* 0 6 b*
0 1 0 0 -1/3 1/3 2

✓ -103,4/4%1=36
1 z*-c y* Z*
t*
T*
= 2- *=y*.b
0 A* S* b*
=

1 y*A-c y* y*b
=
☐ -1oz a) [4%1=4028
0 S*A S* S*b
2-
*

=
 Fundamental Insight
Z Decision variables Slack rhs
variables

1 y A -c
*
y * *
yb
* * *
0 SA S Sb
We can use the fundamental insight for sensitivity analysis.
Vector y* plays a very special role. These are shadow prices.
Fundamental Insight

Optimal value: m
Z * = y * b = å yi *bi
i =1

Old optimal value:

é4 ù
é 3 ùê ú = 36
Z * = y1b1 + y2b2 + y3b3 = ê0 1ú ê12 ú
ë 2 û
êë18 úû
New optimal value:

[¥g)=
|É=
é 3 ùê
é4 ù
Z * = ê0 1ú ê13 úú = 37.5 -10£ 1) 37

ë 2 û
êë18 úû
A-2- = 3$ -
36=10
DZ * = 1.5 35
 E- [ 0 I 1) (Yg) = 36

É = 36 -
36 = 0

*
2- = [ 0
I e) [¥ =
15×1+180 =<☒
42

36
?⃝
 Example : Find the optimal solution by using Revised Simplex
Method
MA , MAD -105s
2M -142Gt 3k$
-
-

Max 2-
=
B V N BV

gey -1322 -12kg + AL

20
St : =
An -0 S ,=q=k=Rz=0
M + 5h2 -

Sn t Ae = 10 A 2=01
M UL Ri

e = [ 2 4 3 ] A
8M ) ay Ms ,
( 2 -9-2%4--1 (4
-
-

[ ] 2- •

↳ =

30M
( 3- 2M )e,
[ to 9)
- ⇐

B
=

43=[7-+1]
2- = 6Mt she -12kg
b
36
 2m -122+12×3 + Sy €2

-4M -24-3/223 + Sz €3
TT able 1
M 1- 2ha -1
Keng + Sg € I

M Rs Nz Sn Sz Sz RHS

s
,

1 3
521-4 -2 -312 ② 0

Ss / 1 '

2
112 0 0 1
t*b
A I

36
 table 3* e
The final
-

¥1ÑÉ=*z¥
+

¥#÷:H→→ A-
*
A

36
 y* [2 02 ]
(? ) 6
*
b
2- = .
= =

b$ = s :b =

^qZ ] (E)
,
= ?

2 2
V2
-

A* =

s&A=[^q?4 / ,
✗

( -4 -2 → =
I

7 2
112
'

y*
.
A -
C =

fzoz ]
[-42-3%-1,2] -

[-6-22] =

36
 -1 :p :L :)
: :
*
:
Max 2- = 4M -13%-1^3+224 2]
[43
:
^

St : 4Mt Last kg -1 Rats , =

Rt 223 -1£
3Mt treat 4
y*.b
=

y•A -

Ky S1 S2 RHS
24 Xz Xz

*y*o=$

t**¥
ka 1 1 -1 O l -
l

5¥ .
# 36
 1

Max 2- = 8Mt 4kg -1 -6kg -13kg -19kg

180
St :
Mt 222-1 3kg -1 Say I

£22770
9Mt 3Mt 2kg -1
By + Rs

3ns t Rg t bag £ 180

Oy +

that the basic variables in the optimal

you are
given
the
facts
solution are se
, ,
,
and Rs and that a) Identify the optimal

£+1:& ? ?;)
solution

fig & ! ]
"

the shadow
=
b) Identify
prices 36
 given

/ -11%
Rz ?

:-&:& :# ¥1: :
•
=

2- = ?
' h= ?
is
'
Ms = ?

b- -
I '%g )

I :I :i÷÷÷I× -11%1=1%1
2-143.15-1.6=77%15?§]= -

CB
ago
36
 6891×1*1! ! %) =/ !! ;)
'
b) Cb B-
.

= [

36
 NBV
Max 2 =
EM 1-
8
Rz 1- 7-
Rz -14k¢ 1- 6kg -10s, +05 Let
7- vars m=..
3kg
s,=
2Mt 20
Sf : + 34,1-224+284-+9 = sons

3Mt 5kg 1- 4kg 2k¢ -143-+2

+
= 30 52=30

Using "the revised simplex method to solve the problem . Bv

Io
%] [ Yeo ]

gym ⑦ 4)
b
[ % It F-
-

=
= o
,

[ 9)
51 $22
A
B- ÷
43 If 9)
'
✓
=
sa s a
①

Be M M Ng Ry

-1¥
= 88 7 4 6) Reentering V:

36
?⃝
 [1911%0]=-1%1
/
B- :b =

Min ratio =

[ ?I = 2 :
szka
I 7 :-[ I %;]
" -

[ Bi
u
It : B =
,
£
[§
*
↳
a = tts ] ✓

Bi ? b- -

[1%5]-1%1 =L:) entering

Di ? A E- ki o -315 -

§ %-) ;
✗a
CB,
-

-
- C =

% ]
Crs :B -11 = [ 0
36
 Min ratio
:[ 1=1 : $1 : leaving

-1¥ :[ ¥ E)
-

I" ✓
B. = *
, .

✗2

I
"
↳ = [ s ) ✓

1M¢ )
•

B :b =
-1¥ %)
-

-1¥ ] =L ✓
=

.
O O 0]
CB D? A - C = [ O O
,
as
:{BY = [ 1 1 ]
36
 *
[ 5¥ )= 2-
Giz.bz?b-- [ 4 8) 50 =

R
,=Rz= B- = S
,
=
52=0
2- = 50
Be = 5k , see 5 ,

36