0% found this document useful (0 votes)
3 views7 pages

10930622035 Budhdev Kumar OT

The document discusses optimization techniques used to find the best solutions to various problems within defined constraints. It outlines different types of optimization methods, including mathematical programming, stochastic programming, and multi-objective programming, along with their applications in engineering fields such as mechanical, electrical, and structural design. Additionally, it provides examples of optimization problems and their mathematical formulations.

Uploaded by

officialbudhd3v
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)
3 views7 pages

10930622035 Budhdev Kumar OT

The document discusses optimization techniques used to find the best solutions to various problems within defined constraints. It outlines different types of optimization methods, including mathematical programming, stochastic programming, and multi-objective programming, along with their applications in engineering fields such as mechanical, electrical, and structural design. Additionally, it provides examples of optimization problems and their mathematical formulations.

Uploaded by

officialbudhd3v
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/ 7

CA-2.

Optimization ecl
AIML ,Rol-35
5ODHDEV KUMAR , U"R-N- (093o622 O35
1-Jefine optimizatiou Technipe
optimiratiou tecluipue Tefes to a Vauiety
agoity wed to
of mettadle anod
given peobtene
fnd te best soluton to a
ith a defined set o Coetkaint These teehipuer euplo
ged n yeo feloe cuch au nthewate,eginee
ng, Coputea keiene, eeoeice aud opeatou Deseach
The
pinay goa ot optuteaton i t eithey wininie a
maximize an olijectne fenetou madile dateting ceta coust
Aaints"
5 ditfennt tytu of ktocate pigammip teclnipe"
|" Mathenakcal pagag
beucqaaf Jeekigue " Stochashe pegaip ecligue
(aJ inean
(b) Integen þeagang
(a) Stochatie hinea
puaqamwg (b) stochaste integeu peogawug
(c)ixed integen dinean pag (e Tuo- stage sochaske pregaig
(a) Non- dineas þeagang
chauce- pecqamui
(e) Conwex beogaumen
(es Robust
Conttaiuag þecgang
optimization.
(t) Puadate picgtauumemg
(3 Dynamie pragang
(w broae þeegramung
(æNetucuk optBmizaheu
) couleinatouial obtimizattou
3' Jite 5 apicatiou q optimizatiou u engineing -
Optimization pay a ceeial eote i engnewy acqow Vanieuy
ditcipliee Heue ae 5 appicotioue s
Ü Mechanical Deiga Optimizatian ; optmization ú eupeayed
mechanica engineiy to deig Coutonnt and tyees Hhat
meet feutenane vepuiemeut eile mniirig weiglt,
Cousuptiou Thit includu optmzg
size enegy
stuate aud dineuicn of mechamcal basts, such au teleine
geens, aud heat excanget, to empeawe effc'euy aud sel
et eeialilly
DElecuical powen <ystem otimi zattan : fn electical egineeuig
kupsles to arfuie effleiey Aeliality aud cosf - cffecs's
eues. Thi includer otimizig the aceyent ud inng at
þawee geneatoy, tanemiten , ad diskisukiou atKH to
meef deuaud uetile mininiig dostes aud enig
byteu ctliliy.
iy coutkeol Suaten obtimizati'eu: Engineet Opfmizattou tehn
Tper to deaign outioe kyateut, at egae Qud optmize
Hue teutemamce Vauious egneesing dyteuns , lwch
motive egí ne , aicatt 6eiglt
atemotive and
indetcal peuocee tbtimizatiou heps eu teneig Coutel
puoetnd, optimizing feedbact Aoops and impueng lyta
stalutlity
Stuetwnai Deign otuiatioui Engins ye optimizatom jechuiquu
to desiqn stuctnes Hat aue Cghte, oger aud mee cot
efective . By optimizing te ayout ad dimucics Steeetuat
cieyeut &eh as beam, Calum aua Ca
e r e tlat Hhe sttucteee meets dabety repuireeutt
ueeile minimzLug mateeial cotuetou
Cos
(v) Preceu optimizat'ou in Mofactuung i chtimization techuipeu ag
ucd to imtove mantactuuug poceH pescen and opeation,kuc
peocceng sctecluleug, inyentoy mmauageyeut aud Rego
ece alocatlou By otmiziug peuoductiou

keleduling enginee Qud minimize peoducie csk, seduco


1ead me, nd lncease Oveeau e fficieuy e
eig facilife
Sugle liective and muti
bley?
sigle objective pucgaumeig peobiea
obË eette fnctou that neeos to be
optinized . The goal He values f odecsion
Vauialler
that minimize mayimize tis ngle
gle olijectie funci
uile satltgug au couaint
gyafieu include inean feogaig,
Exampiee ntegea pengaig
and linean peuagtamig peeobtent wlheee
maeimi
Zig peogit, minimizeing Co
maximizig efficuy
Maut-Objective
peegang peeogawming peoblms fn a mai
multi chjeehive
pobles
that need to be , ee cue tuo o
find set
optimízed smultoneoly The to
Wee e
dolutios that refeseut a huacde t4 bet
iffeuent clijcctis, as it otten
cfectivee to thei beut ceves tmfosnible to
to find a ket o dimltaueulyt
Pameto- optimal colutiony , whene
¿mptioueing oue otjective cayes at te
&eming otea
Exaupler include meti -oljective lnean þeuagomeny, mti
clijectie intege feaatlacty peeagameng and mti- oljeetive
emoltioay algoitt, bueh a guete agaitt ad
þauticle sam ostimizatieu
dyuauie otimizateu feuelete 2
Aspect Sfatc optimizatfou Synamie optmizatian
Tiye obtimization at a din- obtimization cve Hme,
gle pout of time Ceueidenuy hanges
Deciien fed
Vauiables
Can
vay ues me

Consideued at a spe Consideed ve


Behauiowe cifie ustauce time haiz en
Modeling Typicay lge yten nuol dif
equuatioy elential epuatiou er
Solueig in ea
differee uatiomy
Exauee
peucgaiy
puobient dynoni ystey
clasiby Linean noninear, eoyey puaduoté puagauy
wt enaste
Lineas pecga Lineax fuaganig peuoste invotve
obtimireig a dlnea eljective fuuncten suliject to w'nea
epuali'y ¿ncguality centaint .
þesduction aud sale
to
of tifeueut ploduch dutiject
qeuendo
laluoe mautku
Non- Linear beuagamng : Thá peobteu nuolvey optimiing
mon- linean olujeeHVe functon Lulject to nen- ln eau eua
inefuaity Coudtalntto
faaunpte: cptimizing the dujqn f a chenica precey reacton
to mainize cowensiou, etficíency wile minirikug opea
Ceats, couideung non- dineaa klnetic aud Cousttart.

otiyective
Taint
functen .a duliect to þotynoiat inequality congt
Exampe: Coponeut lizny
maximun di kelihoocd stmaion te Kogishe regeuieu
quaduat puagtaing ? These pucsieue include an iwelue
cptimizzig a puuadhatte olijective tunction culiject to
a

inean euality'aud intqualty Costaiutt


Exauttes fouttolio optimizatiau, n fnaue, poue geuenatic
obtimizatou fo electical utilfies.
8 A copany manutactues tuo Uaud V Tese peodu
ct awe puocesed th Hhe saye macine s# takes |o minuetey to

macuine cpeates fa a maimn 35


the aleve
hos week " Poxeate madel to
pacbley
" Rso |0-R5 = R 5
fuofit fo4 Rs 2
ket x it ot educt Uand x, uuit f beeduct Vbe peDe
eeded week " Theu the objective functios uil be
He totae aud o meed to

SO, t(x) Maximize ()


No,ecl eh Daud Vtak es to
puoduce vubtcktvely
Runing tiye acine each weck = 35 XGo meay 2I meuy

So, g(x) -t0,t 2*,2100 (i)


and as matluia
lwt pe week . Total ubsty f lea matal pe week
pe
600 Kg»
So, 9,(x): x, to5 X, 6 Gooi)
Maket Tegure Bo0 ik % pebduet v evey week.
9,(e) 8oo -(iv)

So, Cowniniy equ 0), (i), (i) ,CV) we get,


Maximize 7 = 5x, t 2x,
Subject to, lox,t 274 2I00
to"5<2 6oo

*2 0(Non- negative Coshait)


9 se beashical yetod to sowe
Minimze 4|t2 6uwjd to 7-2x, 2

Sol":
Hee, minimize Z -4x, +X2
fox - 229 s 2 -2x,tz =2
2

2 t*2

-24-2
2

No fae qhah, we cau see it alougde


we Cou see tat He
noundeg So, He kolutee
. No doluticu viits fo the giren eoley
(o Sowe the
fououuug gastically , Minimize K: 2,- 2y
to

2x, 2 S2

sol": Hee, minimize 2 X, 2X2

For this , Aue geah i gien alog de.


cau ge the boud aint fououe

-2

o
(o, 1)
Hene e get the minimuun Value
(0,o)
éo, the colutiay

(Ans)

caugo (aud s to be made auticler


A, B,c wit heetve weight (in ton ), voeye (tn
Mettie tons) aud cot (en ttheuyudy fon ut
seshect to) i giveu
The total volye etb tae to exceed 2090
tons ad 2500 metie toy Fonulate the teebey
fo aimuwm Cogf
Atteler weight vol- cest
A 5

9 4 2
Soh: Let Hhe eputred auet ek astfde A, 8, C be *,1,

tuan the givea data, we can Anfer that


fo veye, 4x, t 5x, t
4*g S Z500-0)
Ne, we need to namize tae sctit, &o,

comlainwg egn G), (i). (G0)t+)


max =8*, t9x, t |2*%
5, t<2 t973 S 20oo
424t 572 t42aS 2500

3* Defne te matheuatH cal foun of Obtne zafion pobley.


An obtimizatiou pobleun cau be mathemotay eees
euted
Minimize (De maximize ) flx)
Sulfect to
9- i(%) 0 , fa l,2, ---- ) m
h-j(x)>O, tor j l, 2, ---,þ

otijectie funetteu to be mininized eu maxmizeg.


the vecto of decúion Vauiauey

8- i(x) the inegualit Couhaintt


"h- j(a) Hue Huai'ty Cousteait

Hhe munlet Ct epality ceugtaint

You might also like