Optimization with Disjunctive Constraints

┬╖
┬╖ Lecture Notes in Economics and Mathematical Systems рдкреБрд╕реНрддрдХ 181 ┬╖ Springer Science & Business Media
рдИ-рдмреБрдХ
162
рдкреЗрдЬ
рд░реЗрдЯрд┐рдВрдЧ рдФрд░ рд╕рдореАрдХреНрд╖рд╛рдУрдВ рдХреА рдкреБрд╖реНрдЯрд┐ рдирд╣реАрдВ рд╣реБрдИ рд╣реИ ┬ардЬрд╝реНрдпрд╛рджрд╛ рдЬрд╛рдиреЗрдВ

рдЗрд╕ рдИ-рдмреБрдХ рдХреЗ рдмрд╛рд░реЗ рдореЗрдВ рдЬрд╛рдирдХрд╛рд░реА

The disjunctive cut principle of Balas and Jeroslow, and the related polyhedral annexation principle of Glover, provide new insights into cutting plane theory. This has resulted in its ability to not only subsume many known valid cuts but also improve upon them. Originally a set of notes were written for the purpose of putting together in a common terminology and framework significant results of Glover and others using a geometric approach, referred to in the literature as convexity cuts, and the algebraic approach of Balas and Jeroslow known as Disjunctive cuts. As it turned out subsequently the polyhedral annexation approach of Glover is also closely connected with the basic disjunctive principle of Balas and Jeroslow. In this monograph we have included these results and have also added several published results which seem to be of strong interest to researchers in the area of developing strong cuts for disjunctive programs. In particular, several results due to Balas [4,5,6,7], Glover [18,19] and Jeroslow [23,25,26] have been used in this monograph. The appropriate theorems are given without proof. The notes also include several results yet to be published [32,34,35] obtained under a research contract with the National Science Foundation to investigate solution methods for disjunctive programs. The monograph is self-contained and complete in the sense that it attempts to pool together existing results which the authors viewed as important to future research on optimization using the disjunctive cut approach.

рдЗрд╕ рдИ-рдмреБрдХ рдХреЛ рд░реЗрдЯрд┐рдВрдЧ рджреЗрдВ

рд╣рдореЗрдВ рдЕрдкрдиреА рд░рд╛рдп рдмрддрд╛рдПрдВ.

рдкрдарди рдЬрд╛рдирдХрд╛рд░реА

рд╕реНрдорд╛рд░реНрдЯрдлрд╝реЛрди рдФрд░ рдЯреИрдмрд▓реЗрдЯ
Android рдФрд░ iPad/iPhone рдХреЗ рд▓рд┐рдП Google Play рдХрд┐рддрд╛рдмреЗрдВ рдРрдкреНрд▓рд┐рдХреЗрд╢рди рдЗрдВрд╕реНрдЯреЙрд▓ рдХрд░реЗрдВ. рдпрд╣ рдЖрдкрдХреЗ рдЦрд╛рддреЗ рдХреЗ рд╕рд╛рде рдЕрдкрдиреЗ рдЖрдк рд╕рд┐рдВрдХ рд╣реЛ рдЬрд╛рддрд╛ рд╣реИ рдФрд░ рдЖрдкрдХреЛ рдХрд╣реАрдВ рднреА рдСрдирд▓рд╛рдЗрди рдпрд╛ рдСрдлрд╝рд▓рд╛рдЗрди рдкрдврд╝рдиреЗ рдХреА рд╕реБрд╡рд┐рдзрд╛ рджреЗрддрд╛ рд╣реИ.
рд▓реИрдкрдЯреЙрдк рдФрд░ рдХрдВрдкреНрдпреВрдЯрд░
рдЖрдк рдЕрдкрдиреЗ рдХрдВрдкреНрдпреВрдЯрд░ рдХреЗ рд╡реЗрдм рдмреНрд░рд╛рдЙрдЬрд╝рд░ рдХрд╛ рдЙрдкрдпреЛрдЧ рдХрд░рдХреЗ Google Play рдкрд░ рдЦрд░реАрджреА рдЧрдИ рдСрдбрд┐рдпреЛ рдХрд┐рддрд╛рдмреЗрдВ рд╕реБрди рд╕рдХрддреЗ рд╣реИрдВ.
eReaders рдФрд░ рдЕрдиреНрдп рдбрд┐рд╡рд╛рдЗрд╕
Kobo рдИ-рд░реАрдбрд░ рдЬреИрд╕реА рдИ-рдЗрдВрдХ рдбрд┐рд╡рд╛рдЗрд╕реЛрдВ рдкрд░ рдХреБрдЫ рдкрдврд╝рдиреЗ рдХреЗ рд▓рд┐рдП, рдЖрдкрдХреЛ рдлрд╝рд╛рдЗрд▓ рдбрд╛рдЙрдирд▓реЛрдб рдХрд░рдХреЗ рдЙрд╕реЗ рдЕрдкрдиреЗ рдбрд┐рд╡рд╛рдЗрд╕ рдкрд░ рдЯреНрд░рд╛рдВрд╕рдлрд╝рд░ рдХрд░рдирд╛ рд╣реЛрдЧрд╛. рдИ-рд░реАрдбрд░ рдкрд░ рдХрд╛рдо рдХрд░рдиреЗ рд╡рд╛рд▓реА рдлрд╝рд╛рдЗрд▓реЛрдВ рдХреЛ рдИ-рд░реАрдбрд░ рдкрд░ рдЯреНрд░рд╛рдВрд╕рдлрд╝рд░ рдХрд░рдиреЗ рдХреЗ рд▓рд┐рдП, рд╕рд╣рд╛рдпрддрд╛ рдХреЗрдВрджреНрд░ рдХреЗ рдирд┐рд░реНрджреЗрд╢реЛрдВ рдХрд╛ рдкрд╛рд▓рди рдХрд░реЗрдВ.

рд╕реАрд░реАрдЬрд╝ рдЬрд╛рд░реА рд░рдЦреЗрдВ

рдорд┐рд▓рддреА-рдЬреБрд▓рддреА рдИ-рдмреБрдХ