The Decomposition Algorithm for Linear Programs

DOI10.2307/1911818zbMath0104.14305OpenAlexW1983743030MaRDI QIDQ3288564

Philip Wolfe, George B. Dantzig

Publication date: 1961

Published in: Econometrica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1911818

zbMATH Keywords

applications of probability theory, mathematical programming

Related Items (only showing first 100 items - show all)

Large-scale optimization with the primal-dual column generation method ⋮ Lagrangean relaxation. (With comments and rejoinder). ⋮ Asynchronous optimization of part logistics routing problem ⋮ Strengthening Gilmore's bound for the quadratic assignment problem ⋮ Portfolio optimization with a copula-based extension of conditional value-at-risk ⋮ Robust food-energy-water-environmental security management: Stochastic quasigradient procedure for linkage of distributed optimization models under asymmetric information and uncertainty ⋮ Utility, probabilistic constraints, mean and variance of discounted rewards in Markov decision processes ⋮ Local decomposition methods for linear programming ⋮ The method of double truncation in the decomposition of large-scale problems ⋮ Exploiting special structure in Karmarkar's linear programming algorithm ⋮ Solving nonlinear multicommodity flow problems by the analytic center cutting plane method ⋮ Models for planning capacity expansion of convenience stores under uncertain demand and the value of information ⋮ Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks ⋮ A unified approach for price directive decomposition procedures in integer programming ⋮ A three-level optimization method for fuzzy large-scale multiobjective nonlinear programming problems ⋮ A branch-and-price algorithm for the capacitated facility location problem ⋮ A model-based approach and analysis for multi-period networks ⋮ In situ column generation for a cutting-stock problem ⋮ An interactive fuzzy satisficing method for large-scale multiobjective linear programming problems with block angular structure ⋮ A fuzzy dual decomposition method for large-scale multiobjective nonlinear programming problems ⋮ Lagrangian dual ascent by generalized linear programming ⋮ Cutting planes and column generation techniques with the projective algorithm ⋮ Exact augmented lagrangian approach to multilevel optimization of large-scale systems ⋮ A cutting plane method from analytic centers for stochastic programming ⋮ Branch-and-price algorithm for fuzzy integer programming problems with block angular structure ⋮ A fuzzy satisficing method for large-scale linear programming problems with block angular structure ⋮ Second-order stochastic dominance constrained portfolio optimization: theory and computational tests ⋮ Decentralization of responsibility for site decontamination projects: A budget allocation approach ⋮ An interactive heuristic for financial planning in decentralized organizations ⋮ Incentives, iterative communication, and organizational control ⋮ A distributed simplex algorithm for degenerate linear programs and multi-agent assignments ⋮ A class of Benders decomposition methods for variational inequalities ⋮ Metric selection in fast dual forward-backward splitting ⋮ Distributed decision making----a unified approach. ⋮ Exact solution of network flow models with strong relaxations ⋮ Revised dantzig-wolfe decomposition for staircase-structured linear programs ⋮ Nested decomposition for dynamic models ⋮ Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes ⋮ Determining the optimal flows in zero-time dynamic networks ⋮ A class of Dantzig-Wolfe type decomposition methods for variational inequality problems ⋮ On the resemblance between the Kornai-Liptak and cross decomposition techniques for block-angular linear programs ⋮ Analysis of programming properties and the row-column generation method for 1-norm support vector machines ⋮ An introduction to dynamic generative networks: minimum cost flow ⋮ On total stability of competitive equilibrium ⋮ An interactive fuzzy satisficing method for multiobjective block angular linear programming problems with fuzzy parameters ⋮ Benders decomposition for a class of variational inequalities ⋮ A new warmstarting strategy for the primal-dual column generation method ⋮ Decomposition in global optimization ⋮ A general unconstrained model for transfer pricing in multinational supply chains ⋮ Arc flow formulations based on dynamic programming: theoretical foundations and applications ⋮ Group preference modeling for intelligent shared environments: social welfare beyond the sum ⋮ Extended VIKOR as a new method for solving Multiple Objective Large-Scale Nonlinear Programming problems ⋮ A fuzzy satisficing method for large-scale multiobjective linear programming problems with block angular structure ⋮ Hedging options under transaction costs and stochastic volatility ⋮ Computing solutions to moral-hazard programs using the Dantzig-Wolfe decomposition algorithm ⋮ Using central prices in the decomposition of linear programs ⋮ Concepts of optimality and their uses ⋮ New linearizations of quadratic assignment problems ⋮ A Benders decomposition method for solving stochastic complementarity problems with an application in energy ⋮ Extensions of TOPSIS for multi-objective large-scale nonlinear programming problems ⋮ Efficiency analysis, generating an efficient extreme point for an MOLP, and some comparisons ⋮ Shipment planning at oil refineries using column generation and valid inequalities ⋮ A structure-conveying modelling language for mathematical and stochastic programming ⋮ Foundations of hierarchical control ⋮ Minimization methods with constraints ⋮ Maximum flow problem on dynamic generative network flows with time-varying bounds ⋮ On an algorithm of decentralized optimal control ⋮ A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions ⋮ Reductions of Approximate Linear Programs for Network Revenue Management ⋮ Distributed Robust Model Predictive Control of Interconnected Polytopic Systems ⋮ A Structure Conveying Parallelizable Modeling Language for Mathematical Programming ⋮ Multilevel decomposition of nonlinear programming problems by dynamic programming ⋮ A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality ⋮ Unnamed Item ⋮ Parallel bundle-based decomposition for large-scale structured mathematical programming problems ⋮ Dantzig-Wolfe decomposition of variational inequalities ⋮ New exact techniques applied to a class of network flow formulations ⋮ Analysis and design of communication networks with memory ⋮ Mean, variance and probabilistic criteria in finite Markov decision processes: A review ⋮ Optimization of large-scale systems ⋮ Using an interior point method for the master problem in a decomposition approach ⋮ Chebyshev center based column generation ⋮ An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming ⋮ A fuzzy approach to hierarchical multiobjective programming problems and its application to an industrial pollution control problem ⋮ An interactive fuzzy satisfying method for structured multiobjective linear fractional programs with fuzzy numbers ⋮ Large-scale linear programming: Geometry, working bases and factorizations ⋮ Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem ⋮ Stabilized column generation ⋮ Decomposition for the control of Markovian processes ⋮ Computational experience with advanced implementation of decomposition algorithms for linear programming ⋮ A decomposition-based approach for the multiperiod multiproduct distribution planning problem ⋮ An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem ⋮ Convergence behavior of decomposition algorithms for linear programs ⋮ George B. Dantzig: a legendary life in mathematical programming ⋮ The decomposition principle and algorithms for linear programming ⋮ Extension of the Frank-Wolfe algorithm to concave nondifferentiable objective functions ⋮ A generalized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems ⋮ Multicommodity network flows: The impact of formulation on decomposition ⋮ Bilateral exchange and competitive equilibrium ⋮ Transfer pricing and decentralized dynamic lot-sizing in multistage, multiproduct production processes

This page was built for publication: The Decomposition Algorithm for Linear Programs