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

Unit-3 Integer Programming

The document discusses various programming problems, particularly focusing on integer programming and the methods used to solve them, such as the cutting plane method and simplex method. It outlines the types of programming problems, including all-integer, pure-integer, and mixed-integer programming, and emphasizes the importance of constraints in optimization. Additionally, it provides examples and graphical representations to illustrate the concepts and solutions to these problems.

Uploaded by

seetharatnam500
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)
2 views13 pages

Unit-3 Integer Programming

The document discusses various programming problems, particularly focusing on integer programming and the methods used to solve them, such as the cutting plane method and simplex method. It outlines the types of programming problems, including all-integer, pure-integer, and mixed-integer programming, and emphasizes the importance of constraints in optimization. Additionally, it provides examples and graphical representations to illustrate the concepts and solutions to these problems.

Uploaded by

seetharatnam500
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

LNîE GER PROGRAMM îNG

In all the optmi 2nion echnisucs , the dyim Vasiabley


oftew a e d to be Ceninuous, which Cay take any aeal Value.
)But, in wmany sitation, it is Snti nly PPrspiate and posmSle
to hae feactioma Soiti ony
6omy thiceneu plate Can be wed ft Conitucti on 1
boiles shell.
3. 3 has of Labous time tn a plaject.
syttns, Cetain deim aiasly Can
only hae dis iete. Vau.
Sy: Pipey Calyins cwatee üna heat Schangep may be avaikable
only tn diametee in ciements of in.

Tu Some
faectionad alue
the decision Vasiasly ae neithee pecti al n phyhcally
Meaning ful.
&g :
Tect ebe.

Soutiem
to the neaiy t ù tegee
oytimum Neg of the detm
Techniue.
Vey Solved by ny
ond fe the. Sowtiog withst
ditut to
my t the Con tkaint.
violatinf
Cetzin vaabley epui Aeg Subatantia
ú,TeRownding of vaiably to ati8fy al
inthe Some othe
Nalues
Chauge
te Conteoint,
fhe Rounding t Souion may gvevey fa flom the.
funciem that g
Some gtkt obfeetive
osiginal optimw Value.
Iypes of paoblewn:

i)All - ntegee plogkamming ploblems


ohen al the vaaiables aee Constoained -to t e ony
tneegee velss in anw optiwization poblun.
aty A pisaete ploskamming piobenm
cohen the Vaiales ole staicted to take ony cis caete

Valss
(ii) A mied -inteyu (diuete) paglamming pobam
Cohen Some Vasiably ony le ataicted to tke
tnbege (( diaete) Vales.
postamning ploblem
shen cll the ddestn Vaiabey of an optimiation plobly
alosed to take

Zntegw lagamning Methody

Linea poqeamng Nen-iheai peogtomnig


poblems poblams

Polynonial Geneel noninel


AU-ntge Mined -Sntege
peoblan joglemming Jpoblem

Cuting plane methey Cutingpane Mathoy ALTntege mined


pranchand- baund methad
Benea -and -Bound Methay
ptoblen prosleng
Balay Metod
Geneaake4 penatty
fun ction Mthed
Souential inear integez
plaglawming Metthad
i) Giephi cal Repseientation
Cajel:
poblem :
Maimi e. fx) = 3a +4
Subfect to 3- 12
3x, 41) 66

nd , ae nteges.
Soutioy

(o, -2) (41o) (o,6) (32,o)

a non-Sntegee
C,at (5.5,45), f= 34 souti

B) se tAn Cate the foactions

os6) A,t o,0), f=o


FuD B,4t (40), f= l2
s,45) D, at (o,6) f= 24
at (o) 2), f= 48 (not aeguied; not in
feostbe avea)
A
8 12 20 2L 24 26

4 optimal nteye Sotio)


6 f= 3|

3-4|2

|27

yT-0.
"Tke Tkuncation of the. factomt yat of a ly poblom
aliay gie the Solucten
Case
pioblew);
44 ) , 88

Saution:

(o, -12), (4ro) (o18), (I2-stI4,b)

A, o (o,o), f=o

C, at (ss y)f= 34
ios) D, Co)&) , f= 32
Compae.
at (s4), f= 3|
In this Cae
qtimay Soutien io z0, =8 an
f=32.
oA 2 B6
oo) (4o)

12
GoMARY s cUTTING pANE MET40D

Concept ¢ Cuiting plane


Maxi mie {(x)= 3+4
Sukgected to
3d+1l2<66
ae integu.

fol 3dt12=64
(o,6), (2a, 0)
(o, -2),( 40)

-Addillonel (Secondasy)
X
Daitie) fesikle gion of the
Constaainy ted y fABeD
poblen a deno
the o mal Sotion of the
ploblem wthont Coniideing
the tntegee

B
f=31
2

AdAitionl Gontaint pq and pa ae added to Aedu e the


eiginal feasible gion (ABcD) to hes feasisle gion of ABEFGD
Such thot the Suteme peint of nes feaible Aegion becomey au
inteyey optimal sdution.
= =y f= 3|
)
The Maiw Considetaticn) bo be tekeu co hile telecting the
aÁAionl Contiint
-feastble Aogíon Should alo be a
Rgion that iu skcad off
the paut of the. oligina feasible.
Shoutd not iclule
becatye f the alalittona Centhaintt
any feasible. tntge tolu tions of the Okginal plobleon.

Gomalys Methad tf u- Dntye po_emming Poblems:


poblem :(0
Subseet to
66

all i ae nteges.
>0, i=lto
slack vaiabley added.

method.
by uzing Simplex

Viable
12 -)2
1
3
6 leastve
66
3 pot o
Slemant
-3 -4
T

P. T-0.
fae
Baaic
Naliabley
|8
73
6 22

-f
1 24 -84

able 3:
y -f
Bayic
Vasiably

=-345

Geneate Gomay
homay Constleinty, tona) velue
fast select ay basic Vaiable hawing layet fect
Jt Can be olitten a

2 36
and y to denote
y, Y2. ae yet inplace of X3
non-baic Vaiabls.

Gomdy Conytaaint :
b: o a non -intege
b

obtaind by tun cating the


integes
flacti onal paxts -fem bi and aii
poritie facton (o <gi)
non- negat'e
ncgative factien (0Li )

non- ngyatíve slack Vaiabley st, the cemy


By asking
Costatnt Sation becomes.

St -
non- negative faction
non- ng 4tie nbegeu.

fot 2 36

Com paaisrn with J=)

36
A

36
Gromdy
-f S,
Basic
Vaaiabw

S tot

both negstiee
by Dual sim pled Metho
select pivot oN SMch that b 40
Select pivot Column SucA thegt min

4+ x36 fo y, Colum n

fn S, Ro
Since 24 mininm um 36

fables bi
Basic
Vaiably

-f
36%

=s, 4 , Y,= l
= t= -33

Csnstant
Stpy Qomeys

S, = -t

p.T.o.
(0)
S, Sz b;
Basic
Vasiably

S
(40)

Stepi: Dual simlex metthod


Comn and the pivot Slement

Basic
Vaiable

1
-3
3)
3

1 -3 -)

oytim) Brtegle Soutm,


Gomsys methad -fe Mied -iuneate peogle mming plablems.
plotle: Minimix
Susject to

;0, i etto

Se he ploklen with Me ony rezticted to toee wn tey


Value

p toslem bysmple mtkot by


solution, - the
So)ve-the
neg lectig the Aeiremet.

fna Souti Tasle

Ceficients b;
Veinble

Castaint!
femulate Gomty to teke
Vaiable that y 2yt4ícted
Sine , in the my
Const ait fol
integee Veueg Censtct Gemdy
-

Com pae with

)2
(2)
u, aj =
oheie

ais =

Can be witteu a

(aty +ais ) = B+ (&- )


Constlaint
by intoducing slace vaiable S; the aomy

Smellee tie twU to made the


talke the one oht
Note: ay
he Consteint Cay be eiten
Gomsy Cnstei The

fo Bntegee velisly YS

integes Vasiabl ;

f the pumut ploslen


p. To
)
|2

|2

Gemely Cansl Aaine u

|2

paic
Vasibly

a)
fable 3! -f S
pasic.
Vesiatle

4
32

-f -|2 6

You might also like