1 views

Uploaded by salim

control

- Evolutionary Multiobjective Optimization in Water Resources: The Past, Present, and Future
- 5r1simulatedannealing
- Document 12
- 00_RN2022EN13GLN00_Course_Description
- The Dynamic Berth Allocation Problem for a Container Port
- Uncontrained Gibbs Free Energy Minimization for Phase Equilibrium Calculations in Nonreactive Systems Using an Improved Cuckoo Search Algorithm
- Linear Programming on Excel: Problems and Solutions
- Introduction of pc
- Decision Making
- EGH+00
- Improving NSGA-II With an Adaptive Mutation Operator
- Unit1 Lecture Notes
- Dynamic Economic Dispatch Using Hybrid DE-SQP for Generating Units with Valve-Point Effects
- sdarticle 111.pdf
- Imperialist Competitive Algorithm
- Evolutionary_2variable Xy and Power Scheduling
- A strategic planning...IRAN e USA_Kabirian e Hemmati.pdf
- Strategy Gas Transm
- paper_1285
- L2V4bGlicmlzL2R0bC9kM18xL2FwYWNoZV9tZWRpYS80NzA4

You are on page 1of 3

Teaching Assistant: Zirui Zhou Feb. 11th, 2014

R

a. x1 + x2 + · · · + xN = a, a > 0;

b. xi ≥ 0.

(2) Using the result of (1), establish the arithmetic–geometric mean inequality, i.e.,

x1 + x2 + · · · + xN N

≥ x1 x2 · · · xN ,

N

for xi ≥ 0, with equality only if x1 = x2 = · · · = xN .

Answers:

(1) Let us first consider the case N = 1, and it is easy to see that f1 (a) = a. Now, we move one

step, say N = 2. By the description of the problem, we have

x1 +x2 =a,

x1 ≥0,x2 ≥0

Since x̄2 is arbitrary, then for any feasible x2 the above relationship holds. As result, we have

following equivalence,

x1 +x2 =a, 0≤x≤a

x1 ≥0,x2 ≥0

We see that, when N = 2, the original problem can be reformulated as a dynamic program-

ming problem. Now we assume that

0≤x≤a

By definition, we have

fN (a) = max [x1 x2 · · · xN ] .

x1 +x2 +···+xN =a,

xi ≥0, i=1,2,...,N

1

Let x∗1 , x∗2 , . . . , x∗N denote the optimal solutions of fN (a), and x̂1 , x̂2 , . . . , x̂N denote the opti-

mal solutions of the dynamic programming we assumed. The following two inequalities are

easily verified by the optimality,

max xfN −1 (a − x) = x̂1 x̂2 · · · x̂N ≤ max [x1 x2 · · · xN ] = x∗1 x∗2 · · · x∗N ,

0≤x≤a x1 +x2 +···+xN =a,

xi ≥0, i=1,2,...,N

max [x1 x2 · · · xN ] = x∗1 x∗2 · · · x∗N ≤ x∗N fN −1 (a−x∗N ) ≤ max xfN −1 (a−x) = x̂1 x̂2 · · · x̂N .

x1 +x2 +···+xN =a, 0≤x≤a

xi ≥0, i=1,2,...,N

Thus this two problems are equivalent. In summary, we have the original problem be formu-

lated as the following dynamic programming problem

0≤x≤a

with f1 (a) = a.

(2) Let us exploit more structures of the dynamic reformulation. Now f2 (a) = max0≤x≤a xf1 (a −

x) = max0≤x≤a x(a − x), which is to maximize an univariate quadratic function over the

2

interval [0, a]. And it is easy to see the optimal f2 (a) = a4 , when x1 = x2 = a2 . We guess that

aN

fN (a) = , with x1 = x2 = · · · = xN .

NN

We prove the above guess by mathematical induction. Since we already proved the case

N = 2, let us suppose the following holds

aN −1 |

fN −1 (a) = , with x1 = x2 = · · · = xN −1 .

(N − 1)N −1

By the result of (1), we have

(a − x)N −1

fN (a) = max xfN −1 (a − x) = max x .

0≤x≤a 0≤x≤a (N − 1)N −1

(a−x) N −1

Now the problem becomes to maximize a univariate nonlinear function f (x) = x (N −1)N −1

over

(a−x) (a−x) N −1 N −2

the interval [0, a]. Let us compute the first order derivative f 0 (x) = (N −1)N −1

− x (N −1)N −2

,

and set it to zero we have

a−x

(a − x)N −2 (x − ) = 0.

N −1

Then we have x = a or x = Na . Clearly we can not have x = a, otherwise the objective value

will be 0. Then we have x = Na , and by the inductive hypothesis we have the rest xi = Na ,

which results in

aN

fN (a) = N , with x1 = x2 = · · · = xN .

N

By the above result, we have

x1 + x2 + · · · + xN N

x1 x2 · · · xN ≤ fN (x1 + x2 + · · · + xN ) = ,

N

and the equality holds when x1 = x2 = · · · = xN .

2

Example 2 Let us define the function

N

xpi ,

X

fN (a) = min

R

i=1

PN

a. i=1 xi ≥ a, a > 0;

b. xi ≥ 0, i = 1, 2, . . . , N.

0≤x≤a

with f1 (a) = ap .

- Evolutionary Multiobjective Optimization in Water Resources: The Past, Present, and FutureUploaded byRobert Aguedo
- 5r1simulatedannealingUploaded byAchmad P. Rifai
- Document 12Uploaded byTarak Benslimane
- 00_RN2022EN13GLN00_Course_DescriptionUploaded bysadefkarish
- The Dynamic Berth Allocation Problem for a Container PortUploaded byMadhuShakthi
- Uncontrained Gibbs Free Energy Minimization for Phase Equilibrium Calculations in Nonreactive Systems Using an Improved Cuckoo Search AlgorithmUploaded byJosemarPereiradaSilva
- Linear Programming on Excel: Problems and SolutionsUploaded byacetinkaya92
- Introduction of pcUploaded byvava
- Decision MakingUploaded byMyameSirame
- EGH+00Uploaded byMadhavanIce
- Improving NSGA-II With an Adaptive Mutation OperatorUploaded byJoao Batista Mendes
- Unit1 Lecture NotesUploaded bysignalhuckster
- Dynamic Economic Dispatch Using Hybrid DE-SQP for Generating Units with Valve-Point EffectsUploaded byahmed
- sdarticle 111.pdfUploaded byHossein Baqerzadeh
- Imperialist Competitive AlgorithmUploaded byMochamad Avid Fassamsi
- Evolutionary_2variable Xy and Power SchedulingUploaded byRohan Repale
- A strategic planning...IRAN e USA_Kabirian e Hemmati.pdfUploaded bymarcianunesmcgns
- Strategy Gas TransmUploaded byPGP
- paper_1285Uploaded bysresearcher7
- L2V4bGlicmlzL2R0bC9kM18xL2FwYWNoZV9tZWRpYS80NzA4Uploaded bySing Singh
- Chemical Reaction optimizationUploaded byKunal Yadav
- Back Matter1Uploaded bysamyakdhole
- IntroductionEnergyModeling(Yamaguchi)Uploaded byDisyon Dx
- f2_27_05_2011.pdfUploaded bysnadmin
- I nternational Journal Of Computational Engineering Research (ijceronline.com) Vol. 2 Issue. 7Uploaded byInternational Journal of computational Engineering research (IJCER)
- bmw_finrep.ml.pdfUploaded byPrashanth
- Control of Multiple UAVUploaded byDevi Archana Das
- PresentationUploaded byShrenik Jain
- 1-s2.0-S0029549311003542-mainUploaded byacar1
- IUST v4n4p525 EnUploaded byYan Naung Ko

- t 2Uploaded bysalim
- TP2_4Uploaded bysalim
- t 1Uploaded bysalim
- t3Uploaded bysalim
- intro_optUploaded byУзахир УЗИ Армани
- adap 1Uploaded bysalim
- Tentalosning TMA947 070312 2Uploaded bysalim
- tenta13A_2Uploaded bysalim
- sol2Uploaded bysalim
- NLSC Lecture Notes 2016 Sufficient Conditions ChapterUploaded bysalim
- 08520064Uploaded bysalim
- Ma 30087Uploaded bysalim
- IOIPNotesOct2014Uploaded bysalim
- MA30087/50087: Optimisation methods of operational researchUploaded byMarcelo Ziulkoski
- 511 NotesUploaded bysalim
- m11_lec1Uploaded bysalim
- Lewis 1996Uploaded bysalim
- hu2008Uploaded bysalim
- intro_optUploaded byУзахир УЗИ Армани
- intro_optUploaded byУзахир УЗИ Армани
- intro_optUploaded byУзахир УЗИ Армани
- intro_optUploaded byУзахир УЗИ Армани
- Course Outlines 012Uploaded bysalim
- tentoct11Uploaded bysalim
- 07 Homework6 SolUploaded bysalim
- EEE482-FA09-ISSMUploaded bysalim
- Dβsgn(σ (t)) (1)Uploaded bysalim
- lecture_notes_series_optimisation_constrained.pdfUploaded bysalim
- cv-14-lecture-18_3Uploaded bysalim

- corbettbederresumenytfUploaded byapi-263647860
- Perceptrons_algorithm.pdfUploaded byallendoss
- DSA NOV-DEC 2010Uploaded byArivazhaganp_mca
- IntelliJIDEA_ReferenceCardUploaded byqwerty
- valgrind_openmpiUploaded byMona Elfadil
- SAP ADOBE FORM BASICSUploaded bysumeetp87
- Swift MaterialUploaded byAbiodun Sokan
- 1010784257Uploaded byRafael Feria
- AT89S8253-24JIUploaded byAnghelescu Cristina
- Replacing CTS Man With Cisco TMS Deployment Guide TMSXE 4 1 TMS 14Uploaded bycscannell3726
- Multipath.conf HITACHIUploaded byBreno Rodrigues
- UT Dallas Syllabus for cs4485.001.07f taught by Kendra Cooper (kcooper)Uploaded byUT Dallas Provost's Technology Group
- Rej603hmi Um 1mdb07206-Yn EnbUploaded byMarian Ariciuc
- Keyframing by InterpolationUploaded bykmm08
- ARINCDirect FOS Brochure-001Uploaded bykallepalli
- uccx801agUploaded byabbas514
- Laserfiche User Training ManualUploaded byFaisal Afzal Khan
- Pmp Audavoy[1]Uploaded byOyebanji Olajide Fatai
- kesmac_8.0_enUploaded byJoe Smith
- Parker Substrate 4250-InTRAFLOW Dec 2003Uploaded byLaurence Malanum
- St 200810 EnUploaded byPeng Ter
- Highline Excel 2016 Class 02 Excel Fundamentals Formulas, Formula Types, Formula Elements, Functions & Excel's Golden Rule_2.pdfUploaded byAaCristopher Duro
- TRM234 Modelling Subgrade Reaction Using Spring SupportsUploaded byRaghunath Balu
- vocalcom how to.pdfUploaded byguijjou
- Beekman Digital Planet 10eUploaded byMuhammad Ghazi
- Console CommandsUploaded byΚυριακος Γιαννοπουλος
- Online Medical Portal projectUploaded byajay patel
- Install LogUploaded byNaufal Budi Wicaksono
- Installation of SAP Content Server DMS on Windows.pdfUploaded byAndres Ortiz
- Business RequirementsUploaded byRamki Jagadishan