An interesting characteristic of phase-1 of dual–primal algorithm for linear programming

DOI10.1080/10556788.2013.814653zbMath1286.65077OpenAlexW2004922724MaRDI QIDQ5746711

No author found.

Publication date: 7 February 2014

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2013.814653

zbMATH Keywords

linear programmingFarkas's lemmadual-primal algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Cites Work

• Unnamed Item
• Pivot rules for linear programming: A survey on recent theoretical developments
• Pivot versus interior point methods: Pros and cons
• A basis-defiency-allowing variation of the simplex method for linear programming
• A least-squares primal-dual algorithm for solving linear programming problems
• A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule
• Dual–primal algorithm for linear optimization
• Combined projected gradient algorithm for linear programming

This page was built for publication: An interesting characteristic of phase-1 of dual–primal algorithm for linear programming