Access the full text.
Sign up today, get DeepDyve free for 14 days.
K. Hoffman, T. Ralphs (2013)
Integer and Combinatorial Optimization
PORTA — Polyhedron representation transformation algorithm
Yves Pochet, L. Wolsey (2010)
Production Planning by Mixed Integer Programming
Franklina Toledo, Maristela Santos, Marcos Arenales, P. Júnior (2008)
Logística de distribuição de água em redes urbanas: racionalização energéticaPesquisa Operacional, 28
S. Hoesel, A. Wagelmans, L. Wolsey (1994)
Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up CostsSIAM J. Discret. Math., 7
Alexander ScHRJJVER, A. Mayne (1989)
Geometric Algorithms and Combinatorial OptimizationJournal of the Operational Research Society
A. Schrijver (1996)
Polyhedral combinatorics
M. Constantino (1996)
A cutting plane approach to capacitated lot-sizing with start-up costsMathematical Programming, 75
M. Escalante, J. Marenco, María Varaldo (2011)
A polyhedral study of the single-item lot-sizing problem with continuous start-up costsElectron. Notes Discret. Math., 37
In this work we consider the uniform capacitated single-item single-machine lot-sizing problem with continuous start-up costs. A continuous start-up cost is generated in a period whenever there is a nonzero production in the period and the production capacity in the previous period is not saturated. This concept of start-up does not correspond to the standard (discrete) start-up considered in previous models, thus motivating a polyhedral study of this problem. In this work we explore a natural integer programming formulation for this problem. We consider the polytope obtained as convex hull of the feasible points in this problem. We state some general properties, study whether the model constraints define facets, and present an exponentially-sized family of valid inequalities for it. We analyze the structure of the extreme points of this convex hull, their adjacency and bounds for the polytope diameter. Finally, we study the particular case when the demands are high enough in order to require production in all the periods. We provide a complete description of the convex hull of feasible solutions in this case and show that all the inequalities in this description are separable in polynomial time, thus proving its polynomial time solvability.
Annals of Operations Research – Springer Journals
Published: Jun 7, 2015
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.