A perfect information lower bound for robust lot-sizing problems
type: Item
instance of: scholarly article
title: A perfect information lower bound for robust lot-sizing problems
zbMATH Open document ID: 1411.90020
author: Marcio Costa Santos
author: Michael Poss
author: Dritan Nace
published in: Annals of Operations Research
publication date: 2019-03-06T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C15
zbMATH DE Number: 7032620
zbMATH Keywords: multi-stage robust optimization
zbMATH Keywords: perfect information
zbMATH Keywords: lot-sizing problem
zbMATH Keywords: complexity
describes a project that uses: ROME
MaRDI profile type: Publication
full work available at URL: s10479-018-2908-x
OpenAlex ID: W2608962134
cites work: The robust vehicle routing problem with time windows
cites work: A dynamic programming approach for a class of robust optimization problems
cites work: The Value of Information and Stochastic Programming
cites work: Decomposition for adjustable robust linear optimization subject to uncertainty polytope
cites work: Lagrangean Decomposition for Mean-Variance Combinatorial Optimization
cites work: Adjustable robust solutions of uncertain linear programs
cites work: Robust convex optimization
cites work: Robust solutions of linear programming problems contaminated with uncertain data
cites work: Multistage robust mixed-integer optimization with adaptive partitions
cites work: Design of Near Optimal Decision Rules in Multistage Adaptive Mixed-Integer Optimization
cites work: Robust discrete optimization and network flows
cites work: The Price of Robustness
cites work: A Robust Optimization Approach to Inventory Theory
cites work: Computing robust basestock levels
cites work: 2-stage robust MILP with continuous recourse variables
cites work: Introduction to Stochastic Programming
cites work: Robust scheduling with budgeted uncertainty
cites work: Uncertain Linear Programs: Extended Affinely Adjustable Robust Counterparts
cites work: Robust optimization of uncertain multistage inventory systems with inexact data in decision rules
cites work: Distributionally Robust Optimization and Its Tractable Approximations
cites work: Robust counterparts of inequalities containing sums of maxima of linear functions
cites work: Sharp Bounds on the Value of Perfect Information
cites work: Primal and dual linear decision rules in stochastic and robust optimization
cites work: Polyhedra for lot-sizing with Wagner-Whitin costs
cites work: Robust combinatorial optimization with variable budgeted uncertainty
cites work: Multistage adjustable robust mixed-integer optimization via iterative splitting of the uncertainty set
cites work: Solving two-stage robust optimization problems using a column-and-constraint generation method
Wikidata QID: Q129736728
DOI: 10.1007/S10479-018-2908-X
Recommended article: A robust lot sizing problem with ill-known demands
Recommended article: Lower bounds in lot-sizing models: A polyhedral study
Recommended article: Robust optimization for lot-sizing problems under yield uncertainty
Recommended article: Approximate solutions for a stochastic lot-sizing problem with partial customer-order information
Recommended article: Note—Performance Bounds for Lot Sizing Heuristics
Recommended article: A robust model for the lot-sizing problem with uncertain demands
Recommended article: Minimizing the error bound for the dynamic lot size model
Recommended article: A polyhedral study of the static probabilistic lot-sizing problem
Recommended article: Efficient approximation schemes for economic lot-sizing in continuous time
Recommended article: The stochastic lot sizing problem with piecewise linear concave ordering costs
description: scientific article; zbMATH DE number 7032620