A three-stage procurement optimization problem under uncertainty

DOI10.1002/NAV.21541MaRDI QIDQ4629182zbMATH OpenOpenAlexFDO

Authors Mike Prince, J. Cole Smith, Joseph Geunes

Publication date 26 March 2019

Published in Naval Research Logistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.21541

zbMATH Keywords

cutting planesfortificationinteger programmingnetwork interdictionprocurement game

Mathematics Subject Classification ID

Integer programming (90C10) Applications of game theory (91A80)

Recommendations

• Capacity games with supply function competition
• Supplier selection and procurement decisions with uncertain demand, fixed selection costs and quantity discounts
• Procurement portfolio planning for a newsvendor with supplier delivery uncertainty
• Procurement strategies with unreliable suppliers
• Exact and approximate algorithms for the multi-period procurement problem where dedicated supplier capacity can be reserved

Cited in

(6)

• Solving the traveling salesman problem with interdiction and fortification
• Adaptive memory programming for the robust capacitated international sourcing problem
• A brief overview of interdiction and robust optimization
• Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
• Robust flows with adaptive mitigation
• Two-stage nodal network interdiction under decision-dependent uncertainty

This page was built for publication: A three-stage procurement optimization problem under uncertainty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4629182)