Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6893071 | Computers & Operations Research | 2014 | 10 Pages |
Abstract
In this paper, we will investigate a buyer's decision making problem in procuring multiple products, each treated as a newsvendor, from two markets. The contract market has a long lead time, a fixed wholesale price and resource constraints. While the spot market has an instant lead time and a highly volatile price. The purchasing decision at the spot market can be made near the beginning of the selling season to take the advantage of the most recent demand forecast. The buyer needs to determine the purchasing quantity for each product at the two markets to maximize the expected profit by trading off between the resource availability, demand uncertainty and price variability. The procurement decision making is modeled as a bi-level programming problem under both a single resource constraint and under multiple resource constraints. We show that this bi-level programming problem can be formulated as a single-level concave programming problem. We then develop a sequential algorithm which solves for a linear approximation of the concave programming problem in each iteration. This algorithm can be used to solve a real world problem with up to thousands of kinds of products, and is found to be highly efficient and effective.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Hua-ming Song, Hui Yang, Alain Bensoussan, Ding Zhang,