Mixed convexity and optimization results for an \((S-1,S)\) inventory model under a time limit on backorders

DOI10.1007/s10287-011-0134-yzbMath1282.90032OpenAlexW2049772444MaRDI QIDQ395687

Hillel Kumin, Emre Tokgöz

Publication date: 30 January 2014

Published in: Computational Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10287-011-0134-y

zbMATH Keywords

optimizationinventory modelinventory costinteger convexitymixed convexityreal convexity

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning procedures for solving mixed-variables programming problems. Reprint
• Global optimization of mixed-integer bilevel programming problems
• A mixed-integer mathematical modeling approach to exam timetabling
• Operating Characteristics of the (S − 1, S) Inventory System with Partial Backorders and Constant Resupply Times
• An (S − 1, S) Inventory System with Emergency Orders
• On Characterizing the Extrema of a Function of Two Variables, One of Which is Discrete
• Optimal Inventories for an (S − 1, S) System with No Backorders
• The (S − 1, S) Inventory Model under Time Limit on Backorders
• Service constrained inventory models with random lifetimes and lead times
• The (S − 1, S) Inventory Policy Under Compound Poisson Demand
• Continuous-Review (s, S) Inventory Models with State-Dependent Leadtimes