0% found this document useful (0 votes)
14 views5 pages

Sequential Linear Discrete Programming

The document discusses a problem involving minimizing a function subject to certain constraints, specifically focusing on discrete programming. It outlines various mathematical formulations and potential solutions to the optimization problem. Additionally, it highlights the use of mixed-integer programming techniques to address the challenges presented by the problem.

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)
14 views5 pages

Sequential Linear Discrete Programming

The document discusses a problem involving minimizing a function subject to certain constraints, specifically focusing on discrete programming. It outlines various mathematical formulations and potential solutions to the optimization problem. Additionally, it highlights the use of mixed-integer programming techniques to address the challenges presented by the problem.

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

SEQUENTIAL L)NEAR D)SCRETE PROGRAMM2NG

J2doblem: Mininise fx) = 2 +3


Subsect to

I-85
6 o.3, 0.4, o-8, |:2, |-S,

dis Clete veuy Sacl


Souti: In this roblau, the Set
ç t n ated by albwig ony theee
yolues
Vaiasle
the
cent value, te adsacent hi ghe value
ity
adiaceut lowe Velee fo simplifsing the Computati.

z-226

L6)
4.8

Souti
-0-83 Contiutio
P-24 2s.
heneal plscaluse iceete Vaiaby be
hon neae ploen with
Mini mie gCx)
Subsecto 3;(X) e0, j= 2,-.
- p
h (X)= 0, k = lh2.
: e diI, dË2, --- di9y'
(1) (u) (22)

atumed to be
cOkue the f t no derism Vasiabs ae
deyete) f tha vAiasle i
A:r o the jth duceete velle
T

So winy afiee
The abe pblu Cau be Sowed lot
of mied integes ineas plosem ming ploßleme.
by yig afat de Toy la Aeiey Enyansin, the

on-kneel p Aetsions about a


abo ve
pofnt x:

Mini mie fex) = f*) + v ( ) dx


Sus Sect to

9;(x) = Js o) + 9: (*) dxco, J= h2. --m

&x = X-x
Thes Pleobly Ceunst be Sowed mikal- intg
uing
kneas ntoslemming Dech ni uy smce seme the dy ign Vaiasu
ale Qey ceete and non-ntegee.
93
The lycaete Vaiablu ale alafnad ay

cotth
J
Yrs =0 o l , i=b2,-no J= lh2-S

thege des ce te vales dnginso ptosla,


minimize 4)

uhsecte to
no
i-not

3= J,2, --m

ke l,2.-p

ay a Miaed ~int
toblew Cau be Soed
ho ta
y;;(i=}2..no, 3=\,2,--
y;;(i-h. )
theattuy both
L peoban by
Y23 tO3 -03
Y2 Ix2 +o.69 -2.26 g=
-o83
1y13 +o3(oi4yy
Y2
Y23J +o3 iX2L-03 66 486.s+ f=
no
3izb 2, with
to gect Sub
huneten obgective the
beCan
from
-o-3Y24
Y23 403
+0r3Y13
&-.2) (6. y, =àX,
+33(l-|:2) (r2-l-2) Y+
X-X =Sx,Similaiy,
Vesally
desism
NOW,
fsomm
Cinui
tn. sohtin paem
Minii e

Sukset to
21913 +0.23 Yey -0. 23 Ye3 0
gCx) -2-2640.2Yy +0.

solutitni
Sowtien amog nine pokikle

fna solwtin d the

Gon tinwed to Jenate Second


Soutig 4
pAoni mute ptoblem wntit the tnal optimiz<tion
fowd.
NOte:
poSsible outiony :
| 6.5+

3
= Yy (o.8) = X o.8 =0.8
&49
6.03
6

You might also like