0% found this document useful (0 votes)
71 views13 pages

3 - Simplex Method

The document presents the simplex method for solving linear programming problems by minimizing or maximizing an objective function subject to constraints. It formulates the example problem of minimizing F subject to multiple constraints as a standard linear programming problem that can be solved using the simplex table method. The simplex table is populated with coefficients from the objective function and constraints to systematically choose basic variables that optimize the objective function.

Uploaded by

Sanskar Rana
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
71 views13 pages

3 - Simplex Method

The document presents the simplex method for solving linear programming problems by minimizing or maximizing an objective function subject to constraints. It formulates the example problem of minimizing F subject to multiple constraints as a standard linear programming problem that can be solved using the simplex table method. The simplex table is populated with coefficients from the objective function and constraints to systematically choose basic variables that optimize the objective function.

Uploaded by

Sanskar Rana
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

Simblex Mehod

t
Masi aize F + 2%
Subtd to
2 +1,-X 2

6
23 4 , -5x

i-1,2,3
to a

leiruk
tonvt he giuen paoblem
Ar
minimi zation Problem.

Can
be
be staled
stakd aas
The esultina pauoblem

-F - 2
Minimize
Subjed to
2 1,-*3 2

5 6
2 ,

i- 1,2,3
;0
Ahould auoay
aluoayu be
tonstiaints

valus on RHS Ahould


The Ahould be
Nalues h bi
that u, he Censttaint
not-mcaative, the Censraint
hs we wi mudtiply
mulhpl
non-htaaive,
Fo
with-1, wheteN
meAs O .
Can Atattd
Atattd as
problem Can be
9t&ultiha
Then, he
Then,the
F -121 13
Miimize

2 x + , -X 2
subjet
6
234 , 4 5

i:1,2,3
adk Nai ables u0, s20, 0
Bu nnoducinq he
the
he paoblem Can be stated a olloos

Mininize -2%-X +0 A0 5 +Ox6

Subied t
u O15 t 0 c 2
21 +X,-*
5 0x G
231 - +5%a t0

Rsic
vinsd lel cnes
6 o 1.0, o
0 i-1,2,3,4, 5, A
o,,0 ale
LoSesnd pe
0,0, 1 Lwnla

Simlex Table
C -1 2 -1 00 O O

u 5 XRao
8asic bi 3
Ce Vatiables
b
(> const Aa
uu hee
I2
ais
So columud

Layt be e PNot
element
dcudin ba4 veble
SE2 h
1
2
CCea) (agu) (a15)
KEY
RoW

2 5
(cea) (b (ag) (ag3) (aau) 5)(a6
c (as)(asc)1 1 G
0 1 2 O Oo o
T Most nchve

CB x b) + (CB2 b)+ (CB3 b)


(0% 6) + (ox 6) =
0
(Ox 2) +

+ (CBx 21)+(CB3X a1 1
(C1 x a4a)
Ca =C4- -1- O
-1- [Ox2) + (ox2) 4 (oxu)]

- 1
C
C,C -(CRA x a42) (CBaXagn)(Cg3 a3)1
2 - ( o x 1) + (ox-1) 4
(O 41) -

2- 6

-2

Siilaad C -1-0 1 =O-O 0

es O-O O 0-0 =O
hence optiimal Nalu s not
As
AS OU Cate not >0 attain lC
most neqcchivNe
all hus
Sin ce C -2

De oasic Vau able.

aho uu w no
As b munumum e a

oe badic, Nauable
Sonaet
endens he bcAu.
Su JRaNes he bass ohile
ece
C; denott Codt o Nauable n obiedtive undtien
Ci
M
hoblen Outten in standadonm

basi vasúables Jn oloiective


Cgi deoles Codent
phsblem oitteh in stahddoda o LPP
unchen o
wutteh dn
qabite Nalur Cnstant
b dehote e nen
shoulsbe men-
RAS
RHS CPnutraint oPuoblen.

ea aave.

mext toradiom tobe done, optinal AeRuhon h


ho been ahieve hen wsng he
he

CO qd
Con nes Value Coumnd b

(in eapeti m6)

C) Diwide a he valuss b, 1,12,. n n Ke


)
SoLo o he piuot elenent taet e nes Vals.
pive dennen ha alo be diutdsd ith tre.)
wibetome

a Nalues n Asegalde zeo lpt


In keu umn,
he pivot elernend .
yalues
1 Nos,
Noo,o qethina he neo yalue on masning
is to be
Jh CeAmn b Somemehod

used.
Su po se wakd o qd he nts Value to haupending

b ho 6).
Then
Ten ut value Jho a be sekded
to be
(&e yalue codeshordinq to i h nes valn ik utiaourde
b-1
2 iNot eenend
and
Nalue at Jntede dien
&
Coosonding s6i e ' bo, )
K e S o s and teuren
s Nalue o Jndtekedaen

(oadptndin
S.
hese Value , , ,
Let mame

NoD P-3S
Neo value c ob, pivot ernendt
Rt To ahon

C -1 2 -1
a Ratio
Basic bi
Nau ablek bi
ais e
2 2 1 - 1

2
1 1 0)
b6)-24) Piyot

- -1 1 2

-4 2 O

Most -ve
C 4) 1+ 4 = 3
C1
-

Cs
C C -0
-242 0
C -2) =

Co
3
C C-(2) =- 1-2

(-2) =0+2 2
eu =
Cu
optima Value u not
all
Not al Cdste 0 hen te
atained.

Next iteotabon wil be cCaoutd out


.
enters the
he
thud oill entes
Since
OInce C3 most neqetive
6a4.
As o u we Can dhoose ahyone

A
hene o JeaNe
le have asbitnaaily seleed

he basis

Setond Tteiation

Ci -1 -2 - 1 O O

s Ratio
C Basic bi
4RSeluchi)
1 O
2

-1

O O 1

-10 1
(Oj(o) 10
2 ) ( u ) 1 )(2) 4
-

(1,13
2-(-2)=0 (o,4,2
C 1--7) 6 Ca
-

-1-1)-0 Cu - 0-(-11) -
C

Cs 0-) Cc 0-0 0
obtained
obtaincd,
C20 hus optimal Jol
As al
Oylimal Jeluhen A 0,=4. 21
F (-10) -
10
optimal value
Nole Opbimali Conditien ox inimization phoblam u
C
C C- &ap 0
is 4 value obti
where
OR 6y mug5gi Ci i
P-C 0 as dene 4

OphmalGy Condi tion on maimzahon phobm


Cc; - b; 0
C
OR P-C 0 i

Ouek-2 Maumze 3-2


Subjed to -* E1

31-2 6

20, 0

As By andnoduuna the Aak vasuahled 0 , u>0,


he
he hoblen (an be Jtaltd as l o s
34-21, * 0 1 * O1u
Muimuze
Subied to
1

1-21, 0 u6

20 i-1,2,3,4
Sivoplex table:
-3 O
Ratio
ani ablu
ais (
1 1
1
Pvot et
6 -2 o 2

-0-3 -2 O
Some Ci ae ve hs edMost meqat ue
obbmal seluton i hot attained.
hs entes the basú,
As c it most neqadiue 1
Jeaes the bass.
As Jus munmuim

R utTetation
C - 2
O

CB BaAic b Raio(i
Nau alblu
s hehe)
1 1

-3 O
5 3

Sine not a Meqodhivee solutien


C aste hon- n aatie h t optimal
not attained.
entes he baku
As CC most nea ative 4nus
JRaNes the basu
0 hul
Or
Second Toahon
-3 2

Ci 8 sic b Ratio (bi


Nai ables
ais
Thi gie ais 0) (
h e celuti)

-3 1 -2 1

2 1 1

-18o -12 5
Most Tmeqetive
Sn Le some 6e tot
mot attained.
hus optmali oldion
hon-nea
ative
a i-1,2 hen ninumum naho
Bud a Cte 0 o
Cont be knoomn.
unbounded Seudtrem.
paobam has an
TR
T R

-u0 - 1 00 1
QA-3 Mnmize
Subied o 2500
1 0+ b1,
2000
10 2
2 3A2

0, 0

0 , S520
n to duunq sla Vau ables 0,

he ven pno blem Con be stated a


+O%u t Ois
unimize -40 - 100, * 0
subjed to + O u + 0 s 2500
1014* S1, * 1
Oxs 2000

23 31, + 0 0 u s 0D0

20 i1,2,3,4,5
Sirsplex Table

i - 4 0 -100
- Rotio
Ce Basic b 5 Cs2 he)

2500
10 5 1 O 0 2500 500

2000
1 1 O2000 200
0 0o2 O 1 00 00
O-40-100 0 O O
Most neaadive

Ce 0 hus optimal Jeutien u no dkained


Sinte Some
endtrus he
the basu
badu
As J most neaaine hus ,
C
hu u kaves he batu.
As on min aio

Fiu Ttei oon


Ci -40 - 100
O

Basic Ratio
ttiwoek

1590 O
CaA)
-100 200 1 O
10

o 1
00 10
10

b-20,00 0 O O 10

a41 10)(10)-45) 100-20 0 8


10 10
0
Aable)

C-[oce)a (-10) (
(
( 4o- (4o)
C
ali4hs the optimal Jelution
Sin
Sinec; 0 o
has been obtaind
2 0 0

Optimal Aeludin u giuen au 0,


- 20,o00
Optima value

Tn 4hs baic Nati alle


200, 1500, 5 300
Nen-basic Nasci a bles du

Sast
he peadinq
obseNed norm he ow

T Can be he
to
table hat he Cost tohiient ooespen ding
is
monbasic Nauabe 1 ( c) zeo.

selution exists.
s e l u t i o n exists
an
altetnadive
altei hative
hod
his s an indi takion
o ,, uwe

into the basis place


in lace
So andnoduing 1 easible solution.
solution.
optimal oasic
wil aet dnoth en
w l at

C; -40 - 100 O

Cei Basic b
Na
-4O 1500 1

-100 125 1 O
20
O 5
1so o 10
1

-20,0 0 0 10 0
Me haye 1500 8 =125, s 150 Basic
Naiahl)

0, 4 = 0 Nen-basic Nauablea)
Rence dinothe otimal basie asible selution u
givcn 1S00 125

Obbimal valu -20,0o0

boo basic (optimal) easible AeRtims naney


One
1500
200
and 125
1500
O

150

(obtimal) easible soluthiow


nlni te humbe o mon basic
Ca be obtaincd usina X Y (1-2) X ox 04a1
(1-)1500
8

200 + (4-) 125

1500

00 (1-2)1S0

hat he selkion X w alo auk


Can be Vouied
-20,000pn r all
give he Leme value

0 1

You might also like