Facets for single module and multi-module capacitated lot-sizing problems without backlogging
type: Item
instance of: scholarly article
title: Facets for single module and multi-module capacitated lot-sizing problems without backlogging
zbMATH Open document ID: 1436.90089
author: Manish Kumar Bansal
published in: Discrete Applied Mathematics
publication date: 2019-02-20T00:00:00Z
review text: This article considers the capacitated lot-sizing problem in combinatorial optimization. The author begins with an introduction to lot-sizing problems and their variants, including an overview of the literature. The second section contains the necessary background and an overview of known valid inequalities. The third section examines valid inequalities specific to the studied problem and examines the conditions under which these are facet defining. In particular, the author combines two types of known valid inequalities to produce a new class of inequalities which are facet defining under some conditions. Several properties of these valid inequalities are presented and proven.
reviewed by: Efstratios Rappos
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 7027131
zbMATH Keywords: lot-sizing
zbMATH Keywords: multi-module capacities
zbMATH Keywords: mixing
zbMATH Keywords: sequential pairing
zbMATH Keywords: mixed integer programming
zbMATH Keywords: cutting planes
MaRDI profile type: Publication
full work available at URL: j.dam.2018.07.029
OpenAlex ID: W2893734128
cites work: Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
cites work: Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
cites work: n-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem
cites work: Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs
cites work: Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs
cites work: \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem
cites work: Facets for continuous multi-mixing set with general coefficients and bounded integer variables
cites work: Valid inequalities based on simple mixed-integer sets
cites work: Q3995531
cites work: Sequential pairing of mixed integer inequalities
cites work: Cutting Planes for Multistage Stochastic Integer Programs
cites work: A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
cites work: Mixing mixed-integer inequalities
cites work: Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
cites work: Shortest paths, single origin‐destination network design, and associated polyhedra
cites work: A recursive procedure to generate all cuts for 0-1 mixed integer programs
cites work: Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
cites work: Polyhedra for lot-sizing with Wagner-Whitin costs
cites work: Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
cites work: Production Planning by Mixed Integer Programming
cites work: Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
cites work: Q3378954
cites work: The Continuous Mixing Polyhedron
cites work: Relaxations for two-level multi-item lot-sizing problems
cites work: Q4254875
cites work: A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands
Wikidata QID: Q129246162
DOI: 10.1016/J.DAM.2018.07.029
description: scientific article; zbMATH DE number 7027131