The mixing set with flows

被引:14
作者
Conforti, Michele
Di Summa, Marco
Wolsey, Laurence A.
机构
[1] Univ Padua, Dipartimento Matemat Pura & Applicata, I-35121 Padua, Italy
[2] Univ Catholique Louvain, CORE, B-1348 Louvain, Belgium
关键词
mixed integer programming; mixing; lot-sizing;
D O I
10.1137/05064148X
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
It models a "flow version" of the basic mixing set introduced and studied by Gunluk and Pochet [Math. Program., 90 ( 2001), pp. 429-457], as well as the most simple stochastic lot-sizing problem with recourse. More generally it is a relaxation of certain mixed integer sets that arise in the study of production planning problems. We study the polyhedron defined as the convex hull of the above set. Specifically we provide an inequality description, and we also characterize its vertices and rays.
引用
收藏
页码:396 / 407
页数:12
相关论文
共 9 条
[1]  
CONFORTI M, IN PRESS MATH PROGRA
[2]  
CONFORTI M, 2007, C INT PROGR COMB OPT
[3]  
DEFARIAS L, 2005, MIXING MIR SET DIVIS
[4]   On formulations of the stochastic uncapacitated lot-sizing problem [J].
Guan, YP ;
Ahmed, S ;
Miller, AJ ;
Nemhauser, GL .
OPERATIONS RESEARCH LETTERS, 2006, 34 (03) :241-250
[5]   Mixing mixed-integer inequalities [J].
Günlük, O ;
Pochet, Y .
MATHEMATICAL PROGRAMMING, 2001, 90 (03) :429-457
[6]   Tight formulations for some simple mixed integer programs and convex objective integer programs [J].
Miller, AJ ;
Wolsey, LA .
MATHEMATICAL PROGRAMMING, 2003, 98 (1-3) :73-88
[7]   LOT-SIZING WITH CONSTANT BATCHES - FORMULATION AND VALID INEQUALITIES [J].
POCHET, Y ;
WOLSEY, LA .
MATHEMATICS OF OPERATIONS RESEARCH, 1993, 18 (04) :767-785
[8]  
Van Vyve M, 2005, MATH OPER RES, V30, P441, DOI [10.1287/moor.1040.0130, 10.1087/moor.1040.0130]
[9]  
VANVYVE M, 2003, THESIS U CATHOLIQUE