Kis, Tamás and Kovács, András (2013) Exact solution approaches for bilevel lot-sizing. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 226 (2). pp. 237-245. ISSN 0377-2217
|
Text
kis_kovacs_ejor_r3.pdf Download (138kB) | Preview |
Abstract
In this paper we propose exact solution methods for a bilevel uncapacitated lotsizing problem with backlogs. This is an extension of the classical uncapacitated lot-sizing problem with backlogs, in which two autonomous and self-interested decision makers constitute a two-echelon supply chain. The leader buys items from the follower in order to meet external demand at lowest cost. The follower also tries to minimize its costs. Both parties may backlog. We study the leader’s problem, i.e., how to determine supply requests over time to minimize its costs in view of the possible actions of the follower. We develop two mixed-integer linear programming reformulations, as well as cutting planes to cut o� feasible, but suboptimal solutions. We compare the reformulations on a series of benchmark instances.
Item Type: | Article |
---|---|
Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
Depositing User: | Dr. Tamás Kis |
Date Deposited: | 21 Sep 2015 14:00 |
Last Modified: | 04 Apr 2023 11:06 |
URI: | http://real.mtak.hu/id/eprint/27147 |
Actions (login required)
![]() |
Edit Item |