Continuous global optimization over polyhedrons: A new introduction to optimization

MaRDI QIDQ2720360zbMATH OpenFDO

Authors H. Arsham

Publication date 19 August 2002

Published in International Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

linearly constraint optimizationunconstrained optimization

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Linearly constrained global optimization: a general solution algorithm with applications.
• scientific article; zbMATH DE number 2187089
• scientific article; zbMATH DE number 1786147
• scientific article; zbMATH DE number 5007493
• Global optimization of separable objective functions on convex polyhedra via piecewise-linear approximation

Cited in

(6)

• Linearly constrained global optimization: a general solution algorithm with applications.
• \(\mathcal{H}\)-polytope decomposition-based algorithm for continuous optimization
• A space decomposition-based deterministic algorithm for solving linear optimization problems
• New approaches for optimizing over the semimetric polytope
• scientific article; zbMATH DE number 2187089 (Why is no real title available?)
• scientific article; zbMATH DE number 5007493 (Why is no real title available?)

This page was built for publication: Continuous global optimization over polyhedrons: A new introduction to optimization

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