A projective method for linear programming with box-type constraints

DOI10.1007/BF01840460zbMath0627.90062OpenAlexW1974228883WikidataQ58002965 ScholiaQ58002965MaRDI QIDQ1092806

B. George

Publication date: 1986

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

box constraintslower and upper boundsprojective method

Mathematics Subject Classification ID

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

Related Items (2)

Introduction: New approaches to linear programming ⋮ Exploiting special structure in Karmarkar's linear programming algorithm

Cites Work

• A new polynomial-time algorithm for linear programming
• A different convergence proof of the projective method for linear programming

This page was built for publication: A projective method for linear programming with box-type constraints