國立虎尾科技大學 |

Disjunctive Programming

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Disjunctive Programming/ by Egon Balas.
作者:	Balas, Egon.
面頁冊數:	X, 238 p. 24 illus., 6 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Matrix theory. -
電子資源:	https://doi.org/10.1007/978-3-030-00148-3
ISBN:	9783030001483

Disjunctive Programming
Balas, Egon.

Disjunctive Programming[electronic resource] /by Egon Balas. - 1st ed. 2018. - X, 238 p. 24 illus., 6 illus. in color.online resource.

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

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

1023862
Matrix theory.

LC Class. No.: QA184-205

Dewey Class. No.: 512.5

Disjunctive Programming
LDR:02905nam a22003855i 4500 001 988880
003 DE-He213
005 20200702031814.0
007 cr nn 008mamaa
008 201225s2018 gw | s |||| 0|eng d
020 $a 9783030001483 $9 978-3-030-00148-3
024 7 $a 10.1007/978-3-030-00148-3 $2 doi
035 $a 978-3-030-00148-3
050 4 $a QA184-205
072 7 $a PBF $2 bicssc
072 7 $a MAT002050 $2 bisacsh
072 7 $a PBF $2 thema
082 0 4 $a 512.5 $2 23
100 1 $a Balas, Egon. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1211339
245 1 0 $a Disjunctive Programming $h [electronic resource] / $c by Egon Balas.
250 $a 1st ed. 2018.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a X, 238 p. 24 illus., 6 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
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 Matrix theory. $3 1023862
650 0 $a Algebra. $2 gtt $3 579870
650 0 $a Game theory. $3 556918
650 0 $a Algorithms. $3 527865
650 0 $a Combinatorics. $3 669353
650 0 $a Mathematical optimization. $3 527675
650 0 $a Operations research. $3 573517
650 0 $a Decision making. $3 528319
650 1 4 $a Linear and Multilinear Algebras, Matrix Theory. $3 672090
650 2 4 $a Game Theory, Economics, Social and Behav. Sciences. $3 669497
650 2 4 $a Optimization. $3 669174
650 2 4 $a Operations Research/Decision Theory. $3 669176
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030001476
776 0 8 $i Printed edition: $z 9783030001490
856 4 0 $u https://doi.org/10.1007/978-3-030-00148-3
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)