國立高雄大學圖資館 |

Language: English

Back

Disjunctive programming

Balas, Egon.

Disjunctive programming

Record Type:	Electronic resources : Monograph/item
Title/Author:	Disjunctive programmingby Egon Balas.
Author:	Balas, Egon.
Published:	Cham :Springer International Publishing :2018.
Description:	x, 238 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Integer programming.
Online resource:	https://doi.org/10.1007/978-3-030-00148-3
ISBN:	9783030001483$q(electronic bk.)

Disjunctive programming
Balas, Egon.

Disjunctive programming[electronic resource] /by Egon Balas. - Cham :Springer International Publishing :2018. - x, 238 p. :ill., digital ;24 cm.

1 Disjunctive programming and its relation to integer programming -- 2 The convex hull of a disjunctive set -- 3 Sequential convexification of disjunctive sets -- 4 Moving between conjunctive and disjunctive normal forms -- 5 Disjunctive programming and extended formulations -- 6 Lift-and-project cuts for mixed 0-1 programs -- 7 Nonlinear higher-dimensional representations -- 8 The correspondence between lift-and-project cuts and simple disjunctive cuts -- 9 Solving (CGLP)k on the LP simplex tableau -- 10 Implementation and testing of variants -- 11 Cuts from general disjunctions -- 12 Disjunctive cuts from the V -polyhedral representation -- 13 Unions of polytopes in different spaces -- References.

Disjunctive Programming is a technique and a discipline initiated by the author in the early 1970's, which has become a central tool for solving nonconvex optimization problems like pure or mixed integer programs, through convexification (cutting plane) procedures combined with enumeration. It has played a major role in the revolution in the state of the art of Integer Programming that took place roughly during the period 1990-2010. The main benefit that the reader may acquire from reading this book is a deeper understanding of the theoretical underpinnings and of the applications potential of disjunctive programming, which range from more efficient problem formulation to enhanced modeling capability and improved solution methods for integer and combinatorial optimization. Egon Balas is University Professor and Lord Professor of Operations Research at Carnegie Mellon University's Tepper School of Business.

ISBN: 9783030001483$q(electronic bk.)

Standard No.: 10.1007/978-3-030-00148-3doiSubjects--Topical Terms:

281590
Integer programming.

LC Class. No.: T57.74 / .B353 2018

Dewey Class. No.: 519.77

Disjunctive programming
LDR:02560nmm a2200325 a 4500 001 547360
003 DE-He213
005 20190503131609.0
006 m d
007 cr nn 008maaau
008 190709s2018 gw s 0 eng d
020 $a 9783030001483$q(electronic bk.)
020 $a 9783030001476$q(paper)
024 7 $a 10.1007/978-3-030-00148-3 $2 doi
035 $a 978-3-030-00148-3
040 $a GP $c GP
041 0 $a eng
050 4 $a T57.74 $b .B353 2018
072 7 $a PBF $2 bicssc
072 7 $a MAT002050 $2 bisacsh
072 7 $a PBF $2 thema
082 0 4 $a 519.77 $2 23
090 $a T57.74 $b .B171 2018
100 1 $a Balas, Egon. $3 826615
245 1 0 $a Disjunctive programming $h [electronic resource] / $c by Egon Balas.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a x, 238 p. : $b ill., digital ; $c 24 cm.
505 0 $a 1 Disjunctive programming and its relation to integer programming -- 2 The convex hull of a disjunctive set -- 3 Sequential convexification of disjunctive sets -- 4 Moving between conjunctive and disjunctive normal forms -- 5 Disjunctive programming and extended formulations -- 6 Lift-and-project cuts for mixed 0-1 programs -- 7 Nonlinear higher-dimensional representations -- 8 The correspondence between lift-and-project cuts and simple disjunctive cuts -- 9 Solving (CGLP)k on the LP simplex tableau -- 10 Implementation and testing of variants -- 11 Cuts from general disjunctions -- 12 Disjunctive cuts from the V -polyhedral representation -- 13 Unions of polytopes in different spaces -- References.
520 $a Disjunctive Programming is a technique and a discipline initiated by the author in the early 1970's, which has become a central tool for solving nonconvex optimization problems like pure or mixed integer programs, through convexification (cutting plane) procedures combined with enumeration. It has played a major role in the revolution in the state of the art of Integer Programming that took place roughly during the period 1990-2010. The main benefit that the reader may acquire from reading this book is a deeper understanding of the theoretical underpinnings and of the applications potential of disjunctive programming, which range from more efficient problem formulation to enhanced modeling capability and improved solution methods for integer and combinatorial optimization. Egon Balas is University Professor and Lord Professor of Operations Research at Carnegie Mellon University's Tepper School of Business.
650 0 $a Integer programming. $3 281590
650 0 $a Linear programming. $3 185299
650 0 $a Convex domains. $3 198918
650 1 4 $a Linear and Multilinear Algebras, Matrix Theory. $3 274063
650 2 4 $a Game Theory, Economics, Social and Behav. Sciences. $3 274083
650 2 4 $a Algorithms. $3 184661
650 2 4 $a Combinatorics. $3 274788
650 2 4 $a Optimization. $3 274084
650 2 4 $a Operations Research/Decision Theory. $3 273963
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
856 4 0 $u https://doi.org/10.1007/978-3-030-00148-3
950 $a Mathematics and Statistics (Springer-11649)