Journal ArticleDOI
Decomposition Principle for Linear Programs
George B. Dantzig,Philip Wolfe +1 more
TLDR
A technique is presented for the decomposition of a linear program that permits the problem to be solved by alternate solutions of linear sub-programs representing its several parts and a coordinating program that is obtained from the parts by linear transformations.Abstract:
A technique is presented for the decomposition of a linear program that permits the problem to be solved by alternate solutions of linear sub-programs representing its several parts and a coordinating program that is obtained from the parts by linear transformations. The coordinating program generates at each cycle new objective forms for each part, and each part generates in turn from its optimal basic feasible solutions new activities columns for the interconnecting program. Viewed as an instance of a “generalized programming problem” whose columns are drawn freely from given convex sets, such a problem can be studied by an appropriate generalization of the duality theorem for linear programming, which permits a sharp distinction to be made between those constraints that pertain only to a part of the problem and those that connect its parts. This leads to a generalization of the Simplex Algorithm, for which the decomposition procedure becomes a special case. Besides holding promise for the efficient computation of large-scale systems, the principle yields a certain rationale for the “decentralized decision process” in the theory of the firm. Formally the prices generated by the coordinating program cause the manager of each part to look for a “pure” sub-program analogue of pure strategy in game theory, which he proposes to the coordinator as best he can do. The coordinator finds the optimum “mix” of pure sub-programs using new proposals and earlier ones consistent with over-all demands and supply, and thereby generates new prices that again generates new proposals by each of the parts, etc. The iterative process is finite.read more
Citations
More filters
Journal ArticleDOI
A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
TL;DR: A new branch-and-price optimization algorithm, termed “ primal box ”, and a specific branching variable selection rule that significantly reduces the number of explored nodes are proposed, which solve problems of large size to optimality within reasonable computational time.
Journal ArticleDOI
Solving VRPTWs with Constraint Programming Based Column Generation
TL;DR: This paper attempts to solve problems whose graph is cyclic by nature, such as routing problems, by solving the elementary shortest path problem with constraint programming.
Journal ArticleDOI
Inexact Cuts in Benders Decomposition
TL;DR: An inexact cut algorithm is described, its convergence under easily verifiable assumptions is proved, and some computational results from applying the algorithm to a class of stochastic programming problems that arise in hydroelectric scheduling.
Journal ArticleDOI
Subgradient methods for the service network design problem
TL;DR: This work presents local-improvement heuristics for a Service Network Design Problem encountered in the motor carrier industry, based upon subgradients derived from the optimal dual variables of the shipment routing subproblem.
Journal ArticleDOI
Feature Article-Energy Policy Modeling: A Survey
TL;DR: This survey provides an exposition of seven technoeconomic models that are representative of recent work on energy policy, and offers suggestions on the future role of modeling in the public policy process.