Duality Theory of Linear Programs: A Constructive Approach with Applications
From MaRDI portal
Publication:5632351
DOI10.1137/1011060zbMath0225.90024OpenAlexW2085756238MaRDI QIDQ5632351
Michel Balinski, Albert W. Tucker
Publication date: 1969
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1011060
Related Items
A convergent criss-cross method, The role of pivoting in proving some fundamental theorems of linear algebra, Criteria for sufficient matrices, Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution, Probability Distributions on Partially Ordered Sets and Network Interdiction Games, Post-optimality analysis of the optimal solution of a degenerate linear program using a pivoting algorithm, On the enumerative nature of Gomory's dual cutting plane method, The strict complementarity in linear fractional optimization, Duality Theorems and Theorems of the Alternative, Some generalizations of the criss-cross method for quadratic programming, Lexicography and degeneracy: Can a pure cutting plane algorithm work?, Identifying the optimal partition in convex quadratic programming, On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery, Cycling in linear programming problems, The general quadratic optimization problem, An application of homotopy to solving linear programs, Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids, Single Commodity Stochastic Network Design Under Probabilistic Constraint with Discrete Random Variables, Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces, Degeneracy in interior point methods for linear programming: A survey, The theory of linear programming:skew symmetric self-dual problems and the central path*, A finite crisscross method for oriented matroids
