Conic programming models for production planning with clearing functions: formulations and duality

DOI10.1016/j.ejor.2020.11.039zbMath1487.90249OpenAlexW3111248622MaRDI QIDQ2030464

Reha Uzsoy, Karthick Gopalswamy

Publication date: 7 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2020.11.039

zbMATH Keywords

production planningcongestionconic programmingcapacity pricing

Mathematics Subject Classification ID

Convex programming (90C25) Production models (90B30)

Uses Software

• CPLEX
• Gurobi
• CVX
• Pajarito

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear programming models with planned lead times for supply chain operations planning
• Polyhedral approximation in mixed-integer convex optimization
• Outer approximation with conic certificates for mixed-integer convex problems
• Order release planning by iterative simulation and linear programming: theoretical foundation and analysis of its shortcomings
• A cutting plane approach to combinatorial bandwidth packing problem with queuing delays
• Lectures on Modern Convex Optimization
• Production planning with resources subject to congestion
• Aggregate order release planning for time-varying demand
• On Polyhedral Approximations of the Second-Order Cone