Strategic Planning with Start-Time Dependent Variable Costs

We present a strategic planning model in which the activities to be planned, such as production and distribution in a supply network, require technology to be installed before they can be performed. The technology improves over time, so that a decision maker has incentive to delay starting an activity to take advantage of better technology and lower operational costs. The model captures the fundamental trade-off between delaying the start time of an activity and the need for some activities to be performed now. Models of this type are used in the oil industry to plan the development of oil fields. This problem is naturally formulated as a mixed-integer program with a bilinear objective. We develop a series of progressively more compact mixed-integer linear formulations, along with classes of valid inequalities that make the formulations strong. We also present a specialized branch-and-cut algorithm to solve an extremely compact concave formulation. Computational results indicate that these formulations can be used to solve large-scale instances, whereas a straightforward linearization of the mixed-integer bilinear formulation fails to solve even small instances.

[1]  Egon Balas,et al.  programming: Properties of the convex hull of feasible points * , 1998 .

[2]  Andreas C. Soteriou,et al.  Capacity acquisition and disposal with discrete facility sizes , 1994 .

[3]  S. Rajagopalan,et al.  Capacity Expansion and Equipment Replacement: A Unified Approach , 1998, Oper. Res..

[4]  Tony J. Van Roy,et al.  A Dual-Based Procedure for Dynamic Facility Location , 1982 .

[5]  Hanif D. Sherali,et al.  Mixed-integer bilinear programming problems , 1993, Math. Program..

[6]  James R. Luedtke Integer Programming Approaches for Some Non-convex and Stochastic Optimization Problems , 2007 .

[7]  T. Morton,et al.  Capacity Expansion and Replacement in Growing Markets with Uncertain Technological Breakthroughs , 1998 .

[8]  Laurence A. Wolsey,et al.  Packing and covering a tree by subtrees , 1986, Comb..

[9]  Aimo A. Törn,et al.  Global Optimization , 1999, Science.

[10]  Laurence A. Wolsey,et al.  Strong Formulations for Multi-Item Capacitated Lot Sizing , 1984 .

[11]  Shanling Li,et al.  Dynamic Capacity Expansion Problem with Multiple Products: Technology Selection and Timing of Capacity Additions , 1994, Oper. Res..

[12]  Vernon Ning Hsu,et al.  Dynamic Capacity Expansion Problem with Deferred Expansion and Age-Dependent Shortage Cost , 2001, Manuf. Serv. Oper. Manag..

[13]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[14]  Alexander Shulman,et al.  An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes , 1991, Oper. Res..