The sagitta method for solving linear programs

DOI10.1016/S0377-2217(03)00276-5MaRDI QIDQ703904zbMATH OpenFDO

Authors Ángel Santos-Palomo

Publication date 12 January 2005

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0377-2217(03)00276-5

zbMATH Keywords

Linear programmingNon-simplex active-set method

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• The generalized simplex method
• scientific article; zbMATH DE number 3852786
• A method of solving the general problem of linear programming
• scientific article; zbMATH DE number 1504438
• A steepest edge active set algorithm for solving sparse linear programming problems

Cites work

• A direct active set algorithm for large sparse quadratic programs with simple bounds
• A numerically stable dual method for solving strictly convex quadratic programs
• A numerically stable form of the simplex algorithm
• An exterior-point method for linear programming problems
• Criss-cross methods: A fresh view on pivot algorithms
• Encyclopedia of optimization. In 6 vols.
• Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
• Handbook of applied optimization
• scientific article; zbMATH DE number 4018762 (Why is no real title available?)
• scientific article; zbMATH DE number 4215266 (Why is no real title available?)
• scientific article; zbMATH DE number 3915531 (Why is no real title available?)
• scientific article; zbMATH DE number 41026 (Why is no real title available?)
• scientific article; zbMATH DE number 47262 (Why is no real title available?)
• scientific article; zbMATH DE number 3497901 (Why is no real title available?)
• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• scientific article; zbMATH DE number 653033 (Why is no real title available?)
• scientific article; zbMATH DE number 1017028 (Why is no real title available?)
• scientific article; zbMATH DE number 194432 (Why is no real title available?)
• scientific article; zbMATH DE number 194636 (Why is no real title available?)
• scientific article; zbMATH DE number 3308846 (Why is no real title available?)
• Inertia-Controlling Methods for General Quadratic Programming
• Linear programming via least squares
• Nonadjacent extreme point methods for solving linear programs
• Numerical Methods for Large Sparse Linear Least Squares Problems
• Pivot rules for linear programming: A survey on recent theoretical developments
• The Criss-Cross Method for Solving Linear Programming Problems

Cited in

(5)

• A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs
• A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule
• The Criss-Cross Method for Solving Linear Programming Problems
• Deepest point of a polyhedron and linear programming
• On simplex method with most-obtuse-angle rule and cosine rule

Describes a project that uses

Uses Software

• nag
• TOMLAB

This page was built for publication: The sagitta method for solving linear programs

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