1 Min Problem Non standard form

Max N Mm x

e min 2 3 1 5 2
g
Man 2 3 5 2
1

only changes in
pre iterative post iterative process
I
hull both report a
slightly differently
sides l
by
2 3 1 5 0 Augmented form
2

when optimality achieved

2 RIB 13

we report it like this 7 2 13 2 13 met 1

again by
2 when a variable is URS e.g x2 urs in
prototype example
Max 2 3 1 t 5 2

N E 4

2 2 I 12

3 1 t 2 2 E 18

Xi 30
x2 Urs

remove and replace How this works

X2 K K2 e.ge x2 4

where ki ka 70 I
I 5
O 4 infinite but fue combinations
 2.3 6.3

now xn 4

I
7 3

4 O
again but toe
a
6 5 2.5 combinations

5 I

9 5

how XL 0

4 U
same
logic
2 5 2 s

shift from Ki Eliz to Nyt xj

XL Ki K2

2 3 1 5 0
2

2 3 1 5114 112 0

2 3 1 514 5111 0

x at Xj replacing x2 column
5 5 with xy q i with
swapped signs
O O

2 2
 2 2

3 when a constraint operator is

no slack variable

important point here

introduce as yourself

constraint Is valid only for value O only feasible value

Artificial variable not a real variable nut serves the purpose of

a variable even though it will take only I value i e o and
by
definition this should be a constant but we treat it as AV for
the purpose it serves

some books represent the following format

neg
ti si ai
can also use her i e Is for Av

what ensures I will take value 0 signs co efficient A Obi Function

Max 2 3 1 5 2 M Is Big M method

when or Z type

to M does not matter Ex will matter

L 3 1 5 4 ME O

93 0
XI t

2 2 t Xu 12

3 1 2 2 Is 18

2 3 1 5 2 ME O

3Mt AM X2 MI5 8M
2 317 3
1 12Mt 5 x2 18M