QBA 68J

SessionPlan
Attendance
CoursePlan

Assignment asolution
Lecture #
05
optional 1 Solution
Assignments Solution
Simplex Method Big M
Assignment 6
TransportationModel Introduction
TransportationProblem

HBD Sara Safwat

y
2
6

13
7

8 Final

10

Lecture
Exam
Cancelled lecture
 900pm
Course Plan Monday 6 15 9 45pm 1.7 MI 13 1 122700
700 1000PM

Session Date Topic

I 12 9 General Guidelines Introduction
2 1919 Cancelled

3 26 9 Graphical Method
4 3 10 Graphical Method Concluded

Problem ModelFormulation
5 10 10 Simplex Method
Midterm Notes
MT 22 10 Midterm 7 00 9 00 PM

6 24 10 Big M Method
Transportation Model Introduction
7 31 10 Transportation Problem
Special cases of LPP
8 7 11 Transportation Model Variations
9 14 11 Conditional PayoffTables
Simulation
Queing Theory
10 21 11 Revision
Final 8 12 Final Exam 7 00 10 00 PM
 r
r r

E
E E
r r
u r

É É É ÉÉ É É É
ÉÉ m i n i n s o e

É
É
É É
 Assignment 4 Calculate Tableau 2 of EX1
Basic
o variables X E S 825 54 RHS CornerPoint a
1 S I 2 I 0 0 0 1808 EX2 GraphicalM
This problem is the
2 Sz 2 I 0 1 0 0 1802 Note is the same solvedusing
I 0 0 I theGraphicalMethod but
3 S I 0 45 x with a different E That
yyy yg www.go.gg
are different
Z l 3 0 0 0 0 0

2 Sz 3 0 0 1 0 1 1354
3 530 0 0 É0 1 1 90 X

4 X2 1 I 0 0 0 1 45 X
Z 4 0 0 0 0 3 135
2 cornerPointe
1 X I 0 43 0 0
3 30 Xi 30 optimal
0 1 45 42 75
2 52 0 1 I 0 S o
8245
3 53 0 0 0 0 1 1 90 83 90
4 X2 0 1 43 0 01 3 75 2 255
Z O O 43 0 0 13 255
 5 constructtheinitialplus one simplex
Assignment tableauxforthefollowingLPP
Max Z 2 2 4 3
X
St I X t Xz t X E 400
Xz 2 3 5300
X Xz 200
Xi Xz Xz 70
Max Z X 2 2 4 3

St I X Xz X 5 400
2 X2 12 3 82 300
3 X 483 200
Xz
Xi XzX3 Oj 81,52 537,0

o Bu X E x's 8 I 5 RHS o Not optimal

I 8 I 1 I 1 0 0 400 YE O
Xz

J
2
12010300
3 83 1 I 0 0 0 1 200 1 82 300

Not optimal
I 8 I 42 0 1 420 2508 Xi
Xz
8
1
150 X 43 150
2 X3 0 42 I 0 2 0
51 250
82 0

j s_ soooo
2 600
Assignment 5 constructtheinitialplus one simplex
tableauxforthefollowingLPP
Extra
Max Z 2 2 4 3
X
St I X t Xz t X E 400
Xz 2 3 300
X Xz 200
Xi Xz Xz 70
Max Z X 2 2 4 3

St I X Xz 1 3 5 400
2 X2 12 3 82 300
3 X 483 200
Xz
Xi XzX3 Oj 81,52 537,0

But Ex's 8 525 RHS

1 0 NotOptimal
1 I 1 0 0 400 Xz 0
I S I
I X3 O
2 51 400
52 300
2012010300dg Z o
g
4 0 Notoptimal
Si I 42 0 I Y o
250 NI Xz O

2 42 I 42 0 150 X
83 18
Xz 0 0

D131100012008
52 0
4 53 200
3
2 600
gym
I S 0
1
0 1 42
300
2 1 50
3558 optimal
2
Xz O 42 I 0 42 0 150
É
5258
3 X I 1 0 0 0 I 200 2 800

Z O 1 0 0 0 1 800
Optional 1 Initial plus one Formulation 2 Problem

5 6 6 0 0 0 0 0 0 0 0
BY X Xe Xs 2 3 4 s 6 7 8 RHS X O
I 0 o I 0 0 0 0 0 0 0 400 X 42
43 0
0

2 0 I 0 0 I 0 0 0 0 0 0 2008 8 400
2 52 200
3
3 0 0 0 0 I 0 0 0 0 0 100 X 53 100
54 1,000
55 400
4 2
4 3 7 0 0 0 I 0 0 0 0 1000mm 56 2,000
I 0 0 s
s 0 I 0 0 0 I 0 0 400N 58 10,000
6 3 5 10 0 0 0 0 0 1 0 0 290080 Z O
at no
7
7 2 I 0 0 0 0 0 0 0 1 0 0 0

8 2 4 6 0 0 0 0 0 0 0 I 10,00088
8

Z 5 6 6 0 0 0 0 0 0 0 0 0
Xz O
I 0 0 I 0 0 0 0 0 0 0 400 I 3 0
51 400
2 I

iii
2 0 0 0 0 0 0 0 1 0 2008 52 200
2
0 0 1 0 0 0 0 0 53 100
3
3 0 0 100 X 54 1 ooo
Ss 400
4 8 0 7 0 0 0 1 0 0 3 0 10008 56 2,000
4
s I 0 I 0 0 0 0 I 0 0 0 400,8
13 0 0 0 0 0 1 50
6 10 0 20007 EINO
7 Xz 2 I 0 0 0 0 0 0 0 1 0 0 X

8 S's 10 0 6 0 0 0 0 0 0 4 I 10,0008
17 0 6 0 0 0 0 0 6 0 0
Z 0

Kote Q D Approach
Sparsityphenomena
Degeneracy not
consideredfurther in this course
RHS 0
loopingcondition
The SimplexAlgorithm Differencesbetween

Watie myth
coefficientof A
IoT
1 Transformation I s
3 S A M M I
y
2 Construct the initial simplexTableau
3 Read value of the variables
Value of z
Min note in z 2
OptimalityTest Max no ve in z

FeasibilityTest only when A exists Feasiblewhenall Ai o

4 Pivot Column PC Max most ve in z Min most ve in z 3

Enteringvariable
5 PivotRow PR min ratio Italienne
Leavingvariable

6 calculate the next basicfeasiblesolution nextsimplextableau

Corresponding PC I for the correspondingPE Zeros everywhereelse
Corresponding PR PR
PE
valuesthatwillnotchange Anyrow with a zero corresponding value in PC
column x x x PR
ya
Therestof thevalues
corresponding corresponding
Newvalue old't'dne e
valuein pc valuein pp

a
Multiply the two corresponding values
g Divide by the PE
c
change thesign
d Add to the oldvalue
Transformation
EX 2X 3 2 300 2X 13 2 51 300
Exz X 5 2 3200 X 5 2 52 41 200
EX 3 1 4 2 500 3 1 4 2 A 2 500

Transformation key

LASERHS LHS S RHS

LHS RHS LHS STA RHS

LHS RHS LHS A RHS

The coefficient of A in the objective function

Max M
Min M

Differencesbetween Max and Min problems

I 2 3
The coefficient A solution is Pivol Column
of A in Z optimal when
there are no

Max M ve values in Z Row Most vevalueinz Row

Min M tve values in Z Row Mostyevalueinz Row

 Notes on Transformation
When starting at the Point of xoxo op
origin
Ext X X2 I 100 X Xz 8 100

at the Point of Xi o Xz 0
origin
S 100
 Notes on Transformation
When starting at the Point of xoxo op
Origin

EXZ X Xz 3 100 X Xz 81 100

at the Point of Xi o Xz O
origin
S 100

Violation of Non Negativity constraints

Notes on Transformation
When starting at the Point of
origin 4 2 6,0

EX3 X Xz 100

at the Point of Xi o Xz 0
origin

X Xz 100 0 100

Improper MathematicalRelation
 Fixing the problems in Exz Ex3

Introducing the Artificial variables

EXZ X Xz 3 100 X Xz Si A 100

at the Point of Xi o Xz 0
origin
51 0

A 100

EX3 X Xz 100 Xi Xz A 100

at the Point of Xz
origin Xi
o o

A 100
EX3 Simplex M construct the initial phone simplex tab
Big
Method
2 AFS
Max Z 2X t 4 2 100
3
St I
G
c
X Xz 750 I
2
b
X t Xz 100 soda
3 X Xz 325 25

Xi Xz 30 so too I

Max 2 2 1 4 2 MA MA 3
G 2
St I X Xz S A 50 The point of origin
is not a corner point
2 X X2 182 100 of AFS
3 X1 X2 83 1 2 25

Xi Xz 0381,82 S o A 70,4230

But 8 8 8 IMI Ras Xi O

M I A I 1 1 0 0 1 0 50 XE O
5 0
2 82 I 1 0 1 0 0 0 100 8 100
N A 00
0t 53 0
A 50
myxoma AEZS

Z
Y É E 0800 at Z 75M
Not optimal
Infeasible
 1 I 0 1 0 50 Row 1
M I 0

M M o M son
Em o o

Row 3
M El I o o 1 0 I 25

M M O O M O M 25M

M M o M son
Em o o

M M O O M O M 25M

O 2M M O M M M ISM
2 4 0 0 0 M M O
2

1 É o o o
I
 Buggy Construct
EX3 Simplex the initial phone simplex tab
AhmadMahmoud
X2
2 AFS
Max Z 2X t 4 2 3
100

G
St I c
X Xz 750 I
2 100 b
Xi Xz
3 X t Xz 325

Xi Xz 30 so 100
X
25

St
Max 2
I
2 1
X
4
X2
2

S
MA
A
MA
50
z
yThe of origin
2

is not
pointcorner
a point
2 X X2 82 100 of AFS

X t Xz
3
53 42 25

Xi X2 0 8482,833 Ai Az 0

2 4 O O O M M
0 BY X X S S S A Az RHS
Xi o Not optimal
I Xz O
M I A 1 I I 0 0 0 50 P
81 0Not Feasible
1 I 0 1 0 0 0 100 I 52 100
2
S2 8 0 Infeasible

M 3 2 1100 10125 a Egg

zf.o.net
z
Z 75M
Z
Y É e o E o o
if
EX3 Simplex Big M
2
Max Z 2X 4 2 2 AFS
St I
X 350 100

G
Xz
2 X Xz 100
3 X t Xz 325 1
Xi Xz 30 I
so
d
Max 2 2 1 4 2 MA MAZ as
St I X X2 S A 50
so Poo X
2 X T Xz Sz 100
yThe
I
2
3 X X2 53 1 2 25
point of origin
Xi Xz 0 2,5s 0 A Az o is not a corner point
of AFS

2 4 O O O M M
BY X Xz S Sz S A Az RHS 75M
X o Z
I Al I I I 0 0 I 0 50 P XE O
S O OT NO
2 52 I 1 0 I 0 0 0 100 8 SE 100 FeasibilityTest
53 0
3 10125
4 EEE
4004OOOMMjAz.ES
50

Z 2

Z
Y
É s o e o o
É X O Z 50M 125
2 25

i soon
SE 75 FeasibilityTest
53 0
3 X2 1 I 0 0 1 0 I 25 x Not Feasible
A 25 CNF
Azto
Z
É O E O
É O
É É
Ext Simplex Construct the initial Simplex Tableau
Min z 3X 1 2 4 3
St I X t Xz t Xz 1000

2 2X X2 7 200

3 Xz 2 3 f 800 Christine
Xi Xz Xz O

Min 2 3 1 1 2 4 3 MA MAZ
St I Xi Xz 1 3 A 1000
22 1 1 2 S Az 200
3 X2 2 3 52 800
X S A O

BU B I 8,82 AT RHS
M i A I 1 I 0 0 I 0 1000
8
800

IIIEEE
82
3 82 0 I 2 0 1 0

i
0

m
800 Azt
2
200

1200M
000
É
Ext Simplex Construct the initial Simplex Tableau
Min z 3X 1 2 4 3
St I X Xz t Xz 1000

2 2X X2 7 200

3 Xz 2 3 800
Xi Xz Xz 0

Min Z 3X 1 2 4 3 MA MAZ
St I X Xz Xz A 1000
2 2X X2 S Az 200
3 X2 2 3 52 800
X X X 30 8,5230 An Az o

o By E X 3 8 Rts OT No
I o boo i
EE
I Al I I l o o
y o It Int
2 1001200 51 0
72210 82 800
I
3 Sz 0 I 2 0 0 0 800 x
E
z
I.EE
3 t 400 M M
z 1WO

to 00
t

The solution provided in the next shows

page
initial plus 2 Simplextableaux
Ext Simplex Initial Plus 2
Min z 3X 1 2 4 3
Min Z 3X 1 2 4 3 MA MAZ
St I X t Xz Xz 1000 St I X Xz X A 1000
2X X2 S Az 200
2 2X X2 7 200 3 X2 52
23 800
XiXaX 3058,5230AnAz
3 X2 2 3 I 800 o

Xi Xz Xz 0

3 4 0
I 0 M M
BN X Xz Xs S Sz A Az RHS OT No
I o boo i
EE
Al I I l o o
Int

I 00 1001200
52 800
3 2 01 00 800 At 1000

Say z 3 t 400 M M
z

I 1WO
Al 0
I f Z.gg
fi
1
o o o
Xp 100 OT NO
1 I I 42 9008 8
75
I 2 0
2 FT Inf
2 X I 1
2 0 Yz 0 0 42 100 X S so
82 800
6in

2
Z
05 Feijoo
I Al O O O 42 1
2
1 Yz 500

Ramp
2 X I 42 0 42 0 0 42 100

3 Xz O 12 I 0 1
2 0 0 400

z o no
In off É
EX 5 Construct the initial simplex Tableau
Min Z 2X 1 2 4 34244
St I X Xz so
2
Xz 2
3 Xt 7,300
3 Xi Xz 1 3 800
4 Xz Xp 7200
Xi o fi b 4
 Exs Construct the initial simplex Tableau
Min Z 2X 1 2 4 34244
St I X Xz so
2
Xz 12 3 Xt 7300
3 Xlt Xz 1 3 800
4 Xz 1 4 7200
Xi o fi b 4

Min 2 2 14 2 14 3 2 4 MA MAZAMA
St I Xi X2 A so
2
Xz 2
3 Xt 51 42 300
3 XI 1 24 3 52 800
4 Xz 1 4 83 43 200
Xi ostia 4 8452,8330 Ai Az Az O

2 I 4 2 0 0 0 M M M
BN X X X Xy S Sz S A Az Az RHS
x o
A I I 0 0 0 0 0 I 0 O O X XE O

0 0 0
3 Sz I 1 I 0 0 1 0
i
0
8008 SE
4 As 0 0 1
g I 0 0 1 0 0 I 2008 352 8

Notoptimal
Z
T T
if T T o
f o o o at Infeasible
Ait
Assignment 6 Construct the initial simplex tableau
Min Z X 3 2 2 3
St I X t Xz X 700
2 2 Xi X E 900
3 2 2 3 3 7300
X Xz Xz 7 0

Subject line Assignment 6 68J

Text your full name

Assignment 6 68J

Due
Saturday 29 10

11 55 PM
Simplex Practice Problems
I Construct initial plus one Simplex tableaux
Max Z 2X t Xz
St 3 1 2 2 E 300
X t Xz 200
X Xz 7 0
2 Solve to optimality using the simplex Method
Max Z 4X X2 3 3

St 2X Xz 3
I 400
3
2 2 Xz E 200
X 2
3 E 300
Xi Xz Xz 30
3 Construct initial
simplex tableau
Min Z 2X t 2 2 3 3
St X Xz t Xz 180
Xz E 60
2 2 X3 3 50

Xi Xz Xz 30
Transportation
Model
 The Transportation Model Problem

Introduction

Supply SourceFactory
Demand Destination Warehouse

Supply Demand Balanced Problem

UnbalancedProblem
Supply Demand