Technical Note—Preservation of Additive Convexity and Its Applications in Stochastic Optimization Problems

DOI10.1287/opre.2020.2064zbMath1482.90012OpenAlexW3135147455MaRDI QIDQ5031603

Tong Wang, Xiting Gong

Publication date: 16 February 2022

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.2020.2064

zbMATH Keywords

dynamic programmingmodelssupply chainscapacity managementMarkovinventory rationingdisposalexpeditingremanufacturing systemsserial inventory systems

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)

Cites Work

• On the decomposition property for a dynamic inventory rationing problem with multiple demand classes and backorder
• Joint Inventory and Cash Management for Multidivisional Supply Chains
• Dynamic Capacity Management with General Upgrading
• Technical Note—Optimal Control Policy for Capacitated Inventory Systems with Remanufacturing
• Coordinating Inventory Control and Pricing Strategies for Perishable Products
• Knowledge You Can Act on: Optimal Policies for Assembly Systems with Expediting and Advance Demand Information
• TECHNICAL NOTE—Optimal Product Acquisition, Pricing, and Inventory Management for Systems with Remanufacturing
• On the Structure of Lost-Sales Inventory Models
• Optimal Inventory Policies for Assembly Systems Under Random Demands
• Dynamic Inventory Management with Total Minimum Order Commitments and Two Supply Options
• Optimal Policies for a Capacitated Two-Echelon Inventory System
• Optimal Ordering and Rationing Policies in a Nonstationary Dynamic Inventory Model with n Demand Classes

This page was built for publication: Technical Note—Preservation of Additive Convexity and Its Applications in Stochastic Optimization Problems