LEADER 04204nam  22006975  450 
001 9910300102303321
005 20200702031814.0
010   $a3-030-00148-2
024 7 $a10.1007/978-3-030-00148-3
035   $a(CKB)4100000007181149
035   $a(MiAaPQ)EBC5606692
035   $a(DE-He213)978-3-030-00148-3
035   $a(PPN)232474222
035   $a(EXLCZ)994100000007181149
100   $a20181127d2018      u|         0
101 0 $aeng
135   $aurcnu||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aDisjunctive Programming /$fby Egon Balas
205   $a1st ed. 2018.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2018.
215   $a1 online resource (238 pages)
311   $a3-030-00147-4 
327   $a1 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.
330   $aDisjunctive 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. .
606   $aMatrix theory
606   $aAlgebra
606   $aGame theory
606   $aAlgorithms
606   $aCombinatorial analysis
606   $aMathematical optimization
606   $aOperations research
606   $aDecision making
606   $aLinear and Multilinear Algebras, Matrix Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/M11094
606   $aGame Theory, Economics, Social and Behav. Sciences$3https://scigraph.springernature.com/ontologies/product-market-codes/M13011
606   $aAlgorithms$3https://scigraph.springernature.com/ontologies/product-market-codes/M14018
606   $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010
606   $aOptimization$3https://scigraph.springernature.com/ontologies/product-market-codes/M26008
606   $aOperations Research/Decision Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/521000
615  0$aMatrix theory.
615  0$aAlgebra.
615  0$aGame theory.
615  0$aAlgorithms.
615  0$aCombinatorial analysis.
615  0$aMathematical optimization.
615  0$aOperations research.
615  0$aDecision making.
615 14$aLinear and Multilinear Algebras, Matrix Theory.
615 24$aGame Theory, Economics, Social and Behav. Sciences.
615 24$aAlgorithms.
615 24$aCombinatorics.
615 24$aOptimization.
615 24$aOperations Research/Decision Theory.
676   $a519.77
700   $aBalas$b Egon$4aut$4http://id.loc.gov/vocabulary/relators/aut$0768231
906   $aBOOK
912   $a9910300102303321
996   $aDisjunctive Programming$91564707
997   $aUNINA