Packing and covering a tree by subtrees
Combinatorica
Integer and combinatorial optimization
Integer and combinatorial optimization
Mixed-integer bilinear programming problems
Mathematical Programming: Series A and B
Capacity acquisition and disposal with discrete facility sizes
Management Science
Disjunctive programming: properties of the convex hull of feasible points
Discrete Applied Mathematics
Capacity Expansion and Equipment Replacement: a Unified Approach
Operations Research
Dynamic Capacity Expansion Problem with Deferred Expansion and Age-Dependent Shortage Cost
Manufacturing & Service Operations Management
| Hi-index | 0.00 |
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.