Foundations of Bilevel Programming

· Nonconvex Optimization and Its Applications Книга 61 · Springer Science & Business Media
Π•-ΠΊΠ½ΠΈΠ³Π°
309
Π‘Ρ‚Ρ€Π°Π½ΠΈΡ†ΠΈ
ΠžΡ†Π΅Π½ΠΈΡ‚Π΅ ΠΈ Ρ€Π΅Ρ†Π΅Π½Π·ΠΈΠΈΡ‚Π΅ Π½Π΅ сС ΠΏΠΎΡ‚Π²Ρ€Π΄Π΅Π½ΠΈ Β Π”ΠΎΠ·Π½Π°Ρ˜Ρ‚Π΅ повСќС

Π—Π° Π΅-ΠΊΠ½ΠΈΠ³Π°Π²Π°

Bilevel programming problems are hierarchical optimization problems where the constraints of one problem (the so-called upper level problem) are defined in part by a second parametric optimization problem (the lower level problem). If the lower level problem has a unique optimal solution for all parameter values, this problem is equivalent to a one-level optimization problem having an implicitly defined objective function. Special emphasize in the book is on problems having non-unique lower level optimal solutions, the optimistic (or weak) and the pessimistic (or strong) approaches are discussed. The book starts with the required results in parametric nonlinear optimization. This is followed by the main theoretical results including necessary and sufficient optimality conditions and solution algorithms for bilevel problems. Stationarity conditions can be applied to the lower level problem to transform the optimistic bilevel programming problem into a one-level problem. Properties of the resulting problem are highlighted and its relation to the bilevel problem is investigated. Stability properties, numerical complexity, and problems having additional integrality conditions on the variables are also discussed.
Audience: Applied mathematicians and economists working in optimization, operations research, and economic modelling. Students interested in optimization will also find this book useful.

ΠžΡ†Π΅Π½Π΅Ρ‚Π΅ ја Π΅-ΠΊΠ½ΠΈΠ³Π°Π²Π°

ΠšΠ°ΠΆΠ΅Ρ‚Π΅ Π½ΠΈ ΡˆΡ‚ΠΎ мислитС.

Π˜Π½Ρ„ΠΎΡ€ΠΌΠ°Ρ†ΠΈΠΈ Π·Π° Ρ‡ΠΈΡ‚Π°ΡšΠ΅

ΠŸΠ°ΠΌΠ΅Ρ‚Π½ΠΈ Ρ‚Π΅Π»Π΅Ρ„ΠΎΠ½ΠΈ ΠΈ Ρ‚Π°Π±Π»Π΅Ρ‚ΠΈ
Π˜Π½ΡΡ‚Π°Π»ΠΈΡ€Π°Ρ˜Ρ‚Π΅ ја Π°ΠΏΠ»ΠΈΠΊΠ°Ρ†ΠΈΡ˜Π°Ρ‚Π° Google Play Books Π·Π° Android ΠΈ iPad/iPhone. Автоматски сС синхронизира со смСтката ΠΈ Π²ΠΈ ΠΎΠ²ΠΎΠ·ΠΌΠΎΠΆΡƒΠ²Π° Π΄Π° Ρ‡ΠΈΡ‚Π°Ρ‚Π΅ онлајн ΠΈΠ»ΠΈ ΠΎΡ„Π»Π°Ρ˜Π½ ΠΊΠ°Π΄Π΅ ΠΈ Π΄Π° стС.
Π›Π°ΠΏΡ‚ΠΎΠΏΠΈ ΠΈ ΠΊΠΎΠΌΠΏΡ˜ΡƒΡ‚Π΅Ρ€ΠΈ
МоТС Π΄Π° ΡΠ»ΡƒΡˆΠ°Ρ‚Π΅ Π°ΡƒΠ΄ΠΈΠΎΠΊΠ½ΠΈΠ³ΠΈ ΠΊΡƒΠΏΠ΅Π½ΠΈ ΠΎΠ΄ Google Play со ΠΊΠΎΡ€ΠΈΡΡ‚Π΅ΡšΠ΅ Π½Π° Π²Π΅Π±-прСлистувачот Π½Π° ΠΊΠΎΠΌΠΏΡ˜ΡƒΡ‚Π΅Ρ€ΠΎΡ‚.
Π•-Ρ‡ΠΈΡ‚Π°Ρ‡ΠΈ ΠΈ Π΄Ρ€ΡƒΠ³ΠΈ ΡƒΡ€Π΅Π΄ΠΈ
Π—Π° Π΄Π° Ρ‡ΠΈΡ‚Π°Ρ‚Π΅ Π½Π° ΡƒΡ€Π΅Π΄ΠΈ со Π΅-мастило, ΠΊΠ°ΠΊΠΎ ΡˆΡ‚ΠΎ сС Π΅-Ρ‡ΠΈΡ‚Π°Ρ‡ΠΈΡ‚Π΅ Kobo, ќС Ρ‚Ρ€Π΅Π±Π° Π΄Π° ΠΏΡ€Π΅Π·Π΅ΠΌΠ΅Ρ‚Π΅ Π΄Π°Ρ‚ΠΎΡ‚Π΅ΠΊΠ° ΠΈ Π΄Π° ја ΠΏΡ€Π΅Ρ„Ρ€Π»ΠΈΡ‚Π΅ Π½Π° ΡƒΡ€Π΅Π΄ΠΎΡ‚. Π‘Π»Π΅Π΄Π΅Ρ‚Π΅ Π³ΠΈ Π΄Π΅Ρ‚Π°Π»Π½ΠΈΡ‚Π΅ упатства Π²ΠΎ Π¦Π΅Π½Ρ‚Π°Ρ€ΠΎΡ‚ Π·Π° помош Π·Π° ΠΏΡ€Π΅Ρ„Ρ€Π»Π°ΡšΠ΅ Π½Π° Π΄Π°Ρ‚ΠΎΡ‚Π΅ΠΊΠΈΡ‚Π΅ Π½Π° ΠΏΠΎΠ΄Π΄Ρ€ΠΆΠ°Π½ΠΈ Π΅-Ρ‡ΠΈΡ‚Π°Ρ‡ΠΈ.

Π”Ρ€ΡƒΠ³ΠΈ ΠΎΠ΄ ΡΠ΅Ρ€ΠΈΡ˜Π°Ρ‚Π°

ПовСќС од Stephan Dempe

Π‘Π»ΠΈΡ‡Π½ΠΈ Π΅-ΠΊΠ½ΠΈΠ³ΠΈ