Abstract

A stochastic optimization model for capacity expansion for a service industry that incorporates uncertainty in future demand is developed. Based on a weighted set of possible demand scenarios, the model generates a recommended schedule of capacity expressions, and calculates the resulting sales under each scenario. The capacity schedule specifies the size, location, and timing of these expansions that will maximize the company's expected profit. The model includes a budget constraint on available resources. By using Lagrangian relaxation and exploiting the special nested knapsack structure in the sub-problems, an algorithm was developed for its solution. Based on the initial computational results, this algorithm appears to be more efficient than linear programming for this special problem. © 1994 John Wiley & Sons, Inc.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call