Abstract
In this paper, we propose a mixed integer optimization approach for solving the inventory problem with variable lead time, crashing cost, and price—quantity discount. A linear programming relaxation based on piecewise linearization techniques is derived for the problem. It first converts non-linear terms into the sum of absolute terms, which are then linearized by goal programming techniques and linearization approaches. The proposed method can eliminate the complicated multiple-step solution process used in the traditional inventory models. In addition, the proposed model allows constraints to be added by the inventory decision-maker as deemed appropriate in real-world situations.
| Original language | English |
|---|---|
| Pages (from-to) | 1151-1158 |
| Number of pages | 8 |
| Journal | Journal of the Operational Research Society |
| Volume | 52 |
| Issue number | 10 |
| DOIs | |
| State | Published - 10 2001 |
| Externally published | Yes |
Keywords
- Global optimization
- Inventory
- Just-in-time
- Lead time
- Linearization
- Price—quantity discount