Efficient Coding of the Danzig-Wolfe Decomposition (Linear Programming) Algorithm (1978)
The Dantzig-Wolfe decomposition (linear programming) principle published in 1960 involves the solving of large-scale mathematical programming problems of particular structure. Large practical problems of this type typically involve many constraints and a large number of variables. For instance, a manufacturer who manufactures various types of household items (thus having many decision variables) may be faced with a multiplant production and distribution problem, needing to maximize profits subject to many constraints such as factory capacities, market potential, raw material availability, budgetary limitations and legal requirements; of which the coupling constraints. (constraints used to link the common resources) may arise from common budgetary limitations on the plants, from common capital used for expansion, or from demands for products whose production involves more than one plant.
ANZSRC Fields of Research01 - Mathematical Sciences::0103 - Numerical and Computational Mathematics::010399 - Numerical and Computational Mathematics not elsewhere classified
01 - Mathematical Sciences::0102 - Applied Mathematics::010299 - Applied Mathematics not elsewhere classified
08 - Information and Computing Sciences::0802 - Computation Theory and Mathematics::080201 - Analysis of Algorithms and Complexity
RightsCopyright C. H. Oo
Showing items related by title, author, creator and subject.
Brown, R.G.; Chase, Geoff; Hann, C.E. (University of Canterbury. Electrical and Computer EngineeringUniversity of Canterbury. Mechanical Engineering, 2012)This paper describes an algorithm for 3D reconstruction of a smooth surface with a relatively dense set of self-similar point features from two calibrated views. We bypass the usual correspondence problem by triangulating ...
Xu, R.; Morris, K.A.; Woodward, G.K.; Kocak, T. (University of Canterbury. Electrical and Computer Engineering, 2012)Sequential decoding can achieve a very low computational complexity and short decoding delay when the signal- to-noise ratio (SNR) is relatively high. In this paper, a low-complexity high-throughput decoding architecture ...
Loader, Lynn (University of Canterbury. Computer Science, 1983)John H. Reif has recently developed an algorithm which finds the minimum cut of a planar network. This is a modification of an earlier algorithm presented by Itai and Shiloach and has a lower theoretical time bound than ...