NDLI: Relaxations for two-level multi-item lot-sizing problems

Content Provider	Springer Nature Link
Author	Wolsey, Laurence A. Yaman, Hande Vyve, Mathieu
Copyright Year	2013
Abstract	We consider several variants of the two-level lot-sizing problem with one item at the upper level facing dependent demand, and multiple items or clients at the lower level, facing independent demands. We first show that under a natural cost assumption, it is sufficient to optimize over a stock-dominant relaxation. We further study the polyhedral structure of a strong relaxation of this problem involving only initial inventory variables and setup variables. We consider several variants: uncapacitated at both levels with or without start-up costs, uncapacitated at the upper level and constant capacity at the lower level, constant capacity at both levels. We finally demonstrate how the strong formulations described improve our ability to solve instances with up to several dozens of periods and a few hundred products.
Ending Page	523
Page Count	29
Starting Page	495
File Format	PDF
ISSN	00255610
e-ISSN	14364646
Journal	Mathematical Programming
Issue Number	1-2
Volume Number	146
Language	English
Publisher	Springer Berlin Heidelberg
Publisher Date	2013-08-27
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Multi-item Lot-sizing Theoretical, Mathematical and Computational Physics Inventory, storage, reservoirs Mixed integer programming Multi-level Combinatorial optimization Programming involving graphs or networks Analysis of algorithms and problem complexity Mathematical Methods in Physics Calculus of Variations and Optimal Control; Optimization Mathematics of Computing Mixed-integer programming Transportation, logistics Numerical Analysis Extended formulation Combinatorics
Content Type	Text
Resource Type	Article
Subject	Mathematics Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Fixed-charge transportation on a path: optimization, LP formulations and separation

Multi-item lot-sizing with joint set-up costs

Erratum: A tight formulation for uncapacitated lot-sizing with stock upper bounds

Approximate extended formulations

Minimum concave cost flow over a grid network

Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity

On mixing sets arising in chance-constrained programming

Single item lot-sizing with non-decreasing capacities

Lot-sizing with production and delivery time windows

Relaxations for two-level multi-item lot-sizing problems

Similar Documents

Fixed-charge transportation on a path: optimization, LP formulations and separation

Multi-item lot-sizing with joint set-up costs

Erratum: A tight formulation for uncapacitated lot-sizing with stock upper bounds

Approximate extended formulations

Minimum concave cost flow over a grid network

Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity

On mixing sets arising in chance-constrained programming

Single item lot-sizing with non-decreasing capacities

Lot-sizing with production and delivery time windows

Relaxations for two-level multi-item lot-sizing problems