A bi-level programming problem of medicine procurement and production optimization

DOI10.1007/S10898-025-01493-6MaRDI QIDQ6834656zbMATH OpenFDO

Authors Wenjuan Fan, Jingwei Zhang, Kaining Shao, Shaowen Lan, Shuwan Zhu

Publication date 31 March 2026

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10898-025-01493-6

zbMATH Keywords

bi-level programmingprocurementproduction planningvariable neighborhood search algorithm

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites work

• Bilevel linear programming
• Inventory and pricing decisions when dealing with strategic consumers: a comprehensive analysis
• Necessary and sufficient conditions for a penalty method to be exact
• Non-cooperative behavior management in group decision making by a conflict resolution process and its implementation for pharmaceutical supplier selection
• Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount
• Scheduled penalty variable neighborhood search
• The polynomial hierarchy and a simple model for competitive analysis

This page was built for publication: A bi-level programming problem of medicine procurement and production optimization

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