Duality Theory of Linear Programs: A Constructive Approach with Applications

Cited in

(22)

A finite crisscross method for oriented matroids
Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces
Degeneracy in interior point methods for linear programming: A survey
Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution
Cycling in linear programming problems
Criteria for sufficient matrices
The role of pivoting in proving some fundamental theorems of linear algebra
Single commodity stochastic network design under probabilistic constraint with discrete random variables
An application of homotopy to solving linear programs
The strict complementarity in linear fractional optimization
A convergent criss-cross method
Some generalizations of the criss-cross method for quadratic programming
The general quadratic optimization problem
The theory of linear programming:skew symmetric self-dual problems and the central path^*
Duality Theorems and Theorems of the Alternative
Probability Distributions on Partially Ordered Sets and Network Interdiction Games
On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery
Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
On the enumerative nature of Gomory's dual cutting plane method
Lexicography and degeneracy: Can a pure cutting plane algorithm work?
Post-optimality analysis of the optimal solution of a degenerate linear program using a pivoting algorithm
Identifying the optimal partition in convex quadratic programming

This page was built for publication: Duality Theory of Linear Programs: A Constructive Approach with Applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5632351)