scientific article; zbMATH DE number 5182668

MaRDI QIDQ5757142zbMATH OpenFDO

Authors H. Arsham

Publication date 24 August 2007

zbMATH Keywords

pivot algorithmlarge-scale linear programsadvance basisartificial constraint freeartificial variable freenon-Big-M method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Numerical methods of relaxation type (49M20)

Recommendations

• scientific article; zbMATH DE number 724217
• On the solution of linear programming problems with free (unrestricted) variables
• An efficient algorithm for globally solving generalized linear multiplicative programming
• scientific article; zbMATH DE number 1131735
• scientific article; zbMATH DE number 4031393
• An Efficient Algorithm for Large-Scale Nonlinear Programming Problems with Simple Bounds on the Variables
• A fully polynomial time approximation algorithm for generalized linear multiplicative programming
• A computationally stable solution algorithm for linear programs
• Solving Large-Scale Zero-One Linear Programming Problems
• An algorithm for solving a structured class of linear programming problems

Cited in

(7)

• A computationally stable solution algorithm for linear programs
• A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs
• Un algorithme pour la résolution du programme linéaire général
• A two-phase support method for solving linear programs: numerical experiments
• On the simplex algorithm initializing
• An efficient simplex type algorithm for sparse and dense linear programs.
• The big-M method with the numerical infinite \(M\)

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