A polyhedral study of lot-sizing with supplier selection

Discrete Optimization

Volumn 9, Issue 2, 2012, Pages 65-76

  Zhao, Yijia ^a   Klabjan, Diego ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b Northwestern University   (United States)

Author keywords

Facet defining; Lot sizing; Polyhedral analysis

Indexed keywords

FACET-DEFINING; FACET-DEFINING INEQUALITIES; FIXED COST; LEAST COST; LOT SIZING; LOT SIZING PROBLEMS; LOT-SIZING MODELS; POLYHEDRAL ANALYSIS; POLYHEDRAL STUDIES; POLYTOPES; SUFFICIENT AND NECESSARY CONDITION; SUPPLIER SELECTION; TIME-PERIODS; VALID INEQUALITY;

COMPUTER SCIENCE; OPTIMIZATION;

COST ACCOUNTING;

EID: 84862831371     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2011.09.001     Document Type: Article

References (21)

1. Y. Pochet, and L. Wolsey Production Planning by Mixed Integer Programming 2006 Springer New York, NY
2. I. Barany, T. Roy, and L. Wolsey Uncapacitated lot-sizing: the convex hull of solutions Mathematical Programming Studies 22 1984 32 43
3. E. Aghezzaf, and L. Wolsey Modelling piecewise linear concave costs in a tree partitioning problem Discrete Applied Mathematics 50 1994 101 109
4. M. Bhatia, and U. Palekar Lot sizing problems with strong set-up interactions - a variable redefinition approach IIE Transactions 33 2001 357 370 (Pubitemid 32394199)
5. M. Constantino Lower bounds in lot-sizing models: a polyhedral study Mathematics of Operations Research 23 1998 101 118 (Pubitemid 128628153)
6. Y. Pochet, and L. Wolsey Lot-size models with backlogging: strong reformulations and cutting planes Mathematical Programming 40 1988 317 335 (Pubitemid 18621263)
7. M. Constantino A cutting plane approach to capacitated lot-sizing with start-up costs Mathematical Programming 75 1996 353 376 (Pubitemid 126394496)
8. A. Agra, and M. Constantino Lot-sizing with backlogging and start-ups: the case of Wagner-Whitin costs Operations Research 25 1999 81 88
9. G. Belvaux, and L. Wolsey Modelling practical lot-sizing problems as mixed-integer programs Management Science 47 2001 993 1007 (Pubitemid 34192821)
10. Y. Pochet Valid inequalities and separation for capacitated economic lot sizing Operations Research Letters 7 1988 109 115 (Pubitemid 18651164)
11. A. Miller, G. Nemhauser, and M. Savelsbergh On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra European Journal of Operational Research 125 2000 298 315
12. M. Loparic, H. Marchand, and L. Wolsey Dynamic knapsack sets and capacitated lot-sizing Mathematical Programming 95 2003 53 69 (Pubitemid 44757863)
13. A. Atamtürk, and J. Munoz A study of the lot-sizing polytope Mathematical Programming 99 2002 43 65
14. Y. Pochet, and L. Wolsey Lot-sizing with constant batches: formulation and valid inequalities Mathematics of Operations Research 18 1993 767 785
15. J. Leung, T. Magnanti, and R. Vachani Facets and algorithms for capacitated lot sizing Mathematical Programming 45 1989 331 359 (Pubitemid 20613958)
16. L. Lovasz Graph theory and integer programming Annals of Discrete Mathematics 4 1979 141 158
17. M. Loparic, Y. Pochet, and L. Wolsey The uncapacitated lot-sizing problem with sales and safety stocks Mathematical Programming 89 2001 487 504 (Pubitemid 33758495)
18. Y. Pochet, and L. Wolsey Algorithms and Reformulations for Lot Ssizing Problems DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 20 1995 American Mathematical Society 245 293
19. T. Van Roy, and L. Wolsey Valid inequalities for mixed 0-1 programs Discrete Applied Mathematics 14 1986 199 213 (Pubitemid 16591520)
20. Z. Gu, G. Nemhauser, and M. Savelsbergh Lifted flow cover inequalities for mixed 0-1 integer programs Mathematical Programming 85 1999 439 467
21. A. Atamtürk Flow pack facets of the single node fixed-charge flow polytope Operations Research Letters 29 2001 107 114 (Pubitemid 32934916)