Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A dual projective pivot algorithm for linear programming

From MaRDI portal
Publication:1771222
Jump to:navigation, search

DOI10.1023/B:COAP.0000044185.69640.54zbMath1062.90035OpenAlexW2064179647MaRDI QIDQ1771222

Ping-Qi Pan

Publication date: 7 April 2005

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:coap.0000044185.69640.54


zbMATH Keywords

linear programmingprojectionpivotdual algorithmpseudo-basis


Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05)


Related Items (5)

A sparse proximal implementation of the LP dual active set algorithm ⋮ A primal deficient-basis simplex algorithm for linear programming ⋮ A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming ⋮ Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation ⋮ An affine-scaling pivot algorithm for linear programming


Uses Software

  • NETLIB LP Test Set



This page was built for publication: A dual projective pivot algorithm for linear programming

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1771222&oldid=14113332"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 08:33.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki