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
Book ChapterDOI
Chapter 6 Vehicle Routing
TL;DR: This chapter presents a comprehensive overview of the available exact and heuristic algorithms for the VRP, most of which have been adapted to solve other variants.
Journal ArticleDOI
Service network design for freight transportation: a review
TL;DR: This paper reviews different problem formulations published in literature and compares and analyzes and compares the specific solution frameworks and gives recommendations for future research.
Journal ArticleDOI
On two-level optimization
Wayne F. Bialas,Mark H. Karwan +1 more
TL;DR: Characterizations and algorithmic approaches for a class of two-level problems are discussed and a formulation to help model this type of decision making hierarchy is offered.
Journal ArticleDOI
MSLiP: a computer code for the multistage stochastic linear programming problem
TL;DR: This paper describes an efficient implementation of a nested decomposition algorithm for the multistage stochastic linear programming problem and results compare the performance of the algorithm to MINOS 5.0.