The simplex method as a global optimizer: A \(C\)-programming perspective

DOI10.1007/BF01096536zbMath0808.90119MaRDI QIDQ1315444

Suzanne Findlay, Moshe Sniedovich, Emmanuel Macalalag

Publication date: 10 March 1994

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

global optimizationsimplex methodlinear parametric problem\(c\)-programmingcomposite nonlinear optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Linear programming (90C05)

Related Items

Solving a class of multiplicative programming problems via \(C\)- programming, A note on composite concave quadratic programming, On mean-standard deviation ratio problems and beyond via c-programming

Uses Software

• LINDO

Cites Work

• C-programming and the minimization of pseudolinear and additive concave functions
• C-programming. An outline
• Fractional programming - a survey
• Analysis of a class of fractional programming problems
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• Efficient algorithms for solving rank two and rank three bilinear programming problems
• On solving a d.c. programming problem by a sequence of linear programs
• A parametric successive underestimation method for convex multiplicative programming problems
• Linear multiplicative programming
• A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
• Fractional Programming. I, Duality
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item