scientific article; zbMATH DE number 3889273

MaRDI QIDQ3221750zbMATH OpenFDO

Authors L. E. Fajbusovich

Publication date 1984

zbMATH Keywords

coordinate-free approachdual simplex methodlinear constraintssimplex-type algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Recommendations

• A shadow simplex method for infinite linear programs
• Geometric fundamentals of the simplex method in semi-infinite programming
• scientific article; zbMATH DE number 4135710
• scientific article; zbMATH DE number 3920183
• A simplex method for countably infinite linear programs

Cited in

(5)

• Geometric fundamentals of the simplex method in semi-infinite programming
• Simplex method and groups generated by reflections
• A shadow simplex method for infinite linear programs
• scientific article; zbMATH DE number 232263 (Why is no real title available?)
• Separation theorem for linearly constrained LQG optimal control

This page was built for publication:

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