740 research outputs found
A Decomposition Algorithm for Nested Resource Allocation Problems
We propose an exact polynomial algorithm for a resource allocation problem
with convex costs and constraints on partial sums of resource consumptions, in
the presence of either continuous or integer variables. No assumption of strict
convexity or differentiability is needed. The method solves a hierarchy of
resource allocation subproblems, whose solutions are used to convert
constraints on sums of resources into bounds for separate variables at higher
levels. The resulting time complexity for the integer problem is , and the complexity of obtaining an -approximate
solution for the continuous case is , being
the number of variables, the number of ascending constraints (such that ), a desired precision, and the total resource. This
algorithm attains the best-known complexity when , and improves it when
. Extensive experimental analyses are conducted with four
recent algorithms on various continuous problems issued from theory and
practice. The proposed method achieves a higher performance than previous
algorithms, addressing all problems with up to one million variables in less
than one minute on a modern computer.Comment: Working Paper -- MIT, 23 page
Time decomposition of multi-period supply chain models
Many supply chain problems involve discrete decisions in a dynamic environment. The inventory routing problem is an example that combines the dynamic control of inventory at various facilities in a supply chain with the discrete routing decisions of a fleet of vehicles that moves product between the facilities.
We study these problems modeled as mixed-integer programs and propose a time decomposition based on approximate inventory valuation. We generate the approximate value function with an algorithm that combines data fitting, discrete optimization and dynamic programming methodology. Our framework allows the user to specify a class of piecewise linear, concave functions from which the algorithm chooses the value function. The use of piecewise linear concave functions is motivated by intuition, theory and practice. Intuitively, concavity reflects the notion that inventory is marginally more valuable the closer one is to a stock-out. Theoretically, piecewise linear concave functions have certain structural properties that also hold for finite mixed-integer program value functions. (Whether the same properties hold in the infinite case is an open question, to our knowledge.) Practically, piecewise linear concave functions are easily embedded in the objective function of a maximization mixed-integer or linear program, with only a few additional auxiliary continuous variables. We evaluate the solutions generated by our value functions in a case study using maritime inventory routing instances inspired by the petrochemical industry.
The thesis also includes two other contributions. First, we review various data fitting optimization models related to piecewise linear concave functions, and introduce new mixed-integer programming formulations for some cases. The formulations may be of independent interest, with applications in engineering, mixed-integer non-linear programming, and other areas. Second, we study a discounted, infinite-horizon version of the canonical single-item lot-sizing problem and characterize its value function, proving that it inherits all properties of interest from its finite counterpart. We then compare its optimal policies to our algorithm's solutions as a proof of concept.PhDCommittee Chair: George Nemhauser; Committee Member: Ahmet Keha; Committee Member: Martin Savelsbergh; Committee Member: Santanu Dey; Committee Member: Shabbir Ahme
Recommended from our members
Parallel computation of large-scale network equilibria and variational inequalities.
Equilibrium of a network is obtained when each user who competes to optimize his utility can not improve his utility any further. Equilibrium problems governed by distinct equilibrium concepts can be formulated in one general framework--that of variational inequalities. The synthesis of variational inequalities and networks induces the creation of highly efficient algorithms which are especially suited for the large-scale equilibrium problems. Motivated by the recent technological advances in parallel computing architectures, parallel algorithms of large-scale equilibrium problems were developed using the theory of variational inequalities. In the case where the feasible constraint set of a network equilibrium problem can be expressed as a Cartesian product of subsets, the application of variational inequality decomposition algorithms for the parallel computation becomes possible. A new spatial price equilibrium model, which is not based on the path flows, but, rather, on the link flows to allow the decomposition by time periods, was developed and used as a prototype of large-scale network equilibrium problems. The variational inequality formulations were decomposed first by commodities, then by time periods, and, subsequently, by markets. The coarse grain parallel architectures used were the IBM 3090-600E and the IBM 3090-600J at the Cornell Theory Center with six processors each. The maximum speed-ups obtained were 1.93 for two processors, 3.74 for four processors, and 5.15 for six processors. The market subproblems were further decomposed by links, resulting in a fine grain parallel implementation. The Thinking Machine\u27s Connection Machine, CM-2, with 32,768 processors was used for the numerical experimentation. The fine grain parallel algorithm solved input/output matrix problems more than 20 times faster, when compared to the results on the IBM 3090-600J. It is expected that further enhancements to parallel languages and parallel architectures will make even more efficient implementations realizable, and that parallel computing and the theory of variational inequalities can be successfully applied to solve more efficiently other large-scale problems with an underlying network structure, such as traffic equilibrium problems, general economic equilibrium problems, and financial equilibrium problems
- …