An application of homotopy to solving linear programs

DOI10.1007/BF02591903zbMATH Open0526.90061OpenAlexW2084621616MaRDI QIDQ3040926FDOQ3040926

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

• Bimatrix Equilibrium Points and Mathematical Programming
• Monotone solutions of the parametric linear complementarity problem
• Title not available (Why is that?)
• Duality Theory of Linear Programs: A Constructive Approach with Applications
• Title not available (Why is that?)
• A Principal Pivoting Simplex Algorithm for Linear and Quadratic Programming
• A comparison of the primal‐simplex and complementary pivot methods for linear programming

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)