scientific article; zbMATH DE number 428033

MaRDI QIDQ3137560zbMATH OpenFDO

Authors Teodor Toadere

Publication date 1 November 1993

zbMATH Keywords

bisection methodsimplex algorithmcomparison of algorithmsKhachiyan's algorithmsliding objective method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• A better first step for Khachlan's algorithm in linear programming
• The simplex method is not always well behaved
• scientific article; zbMATH DE number 4027159
• scientific article; zbMATH DE number 1064581
• An improved initial basis for the simplex algorithm
• An improved algorithm of simplex method in linear programming problem
• A theoretical comparison between the simplex method and the basic line search algorithm
• scientific article; zbMATH DE number 653033

Cited in

(1)

• Solving worrying simplex's instances in polynomial time

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 Q3137560)