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

DOI10.1007/BF01096536MaRDI QIDQ1315444zbMATH OpenFDO

Authors Moshe Sniedovich, Emmanuel Macalalag, Suzanne Findlay

Publication date 10 March 1994

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

Full work available at URL https://doi.org/10.1007/BF01096536

zbMATH Keywords

\(c\)-programmingcomposite nonlinear optimizationglobal optimizationlinear parametric problemsimplex method

Mathematics Subject Classification ID

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

Review text

For some composite nonlinear optimization problems \(c\)-programming techniques lead to a linear parametric problem, which could be solved by a simplex method. The paper gives a summary over such techniques for global optimization and a number of illustrative examples.

Recommendations

• Simplicial global optimization
• The Efficiency of the Simplex Method: A Survey
• Implementing the simplex method for the Optimization Subroutine Library
• Towards a practical parallelisation of the simplex method
• Simplex-inspired algorithms for solving a class of convex programming problems
• On the complexity of optimization over the standard simplex
• A parallel implementation of the simplex function minimization routine
• scientific article; zbMATH DE number 4011808
• A global optimization approach for solving the convex multiplicative programming problem
• scientific article; zbMATH DE number 653033

Cites work

• A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
• A parametric successive underestimation method for convex multiplicative programming problems
• Analysis of a class of fractional programming problems
• C-programming and the minimization of pseudolinear and additive concave functions
• C-programming. An outline
• Efficient algorithms for solving rank two and rank three bilinear programming problems
• Fractional programming - a survey
• Fractional Programming. I, Duality
• scientific article; zbMATH DE number 3748742 (Why is no real title available?)
• scientific article; zbMATH DE number 47153 (Why is no real title available?)
• scientific article; zbMATH DE number 47262 (Why is no real title available?)
• scientific article; zbMATH DE number 53073 (Why is no real title available?)
• scientific article; zbMATH DE number 3562783 (Why is no real title available?)
• scientific article; zbMATH DE number 3249566 (Why is no real title available?)
• Linear multiplicative programming
• On solving a d.c. programming problem by a sequence of linear programs
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems

Cited in

(6)

• C-programming: A nonlinear parametric optimization method
• A note on composite concave quadratic programming
• Simple linkage: Analysis of a threshold-accepting global optimization method
• Solving a class of multiplicative programming problems via C- programming
• On mean-standard deviation ratio problems and beyond via c-programming
• Algorithmic and computational aspects of composite concave programming

Describes a project that uses

Uses Software

• LINDO

This page was built for publication: The simplex method as a global optimizer: A \(C\)-programming perspective

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