An application of homotopy to solving linear programs

DOI10.1007/BF02591903MaRDI QIDQ3040926zbMATH OpenOpenAlexFDO

Authors

Publication date 1983

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02591903

zbMATH Keywords

inequality constraintssimplex methodapplication of homotopyDantzig's self-dual method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Fixed-point and coincidence theorems (topological aspects) (54H25)

Cites work

• scientific article; zbMATH DE number 3523317 (Why is no real title available?)
• scientific article; zbMATH DE number 3543799 (Why is no real title available?)
• A Principal Pivoting Simplex Algorithm for Linear and Quadratic Programming
• A comparison of the primal‐simplex and complementary pivot methods for linear programming
• Bimatrix Equilibrium Points and Mathematical Programming
• Duality Theory of Linear Programs: A Constructive Approach with Applications
• Monotone solutions of the parametric linear complementarity problem

This page was built for publication: An application of homotopy to solving linear programs

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