scientific article; zbMATH DE number 192898

MaRDI QIDQ4039786zbMATH OpenFDO

Authors Ferenc Forgó

Publication date 5 June 1993

zbMATH Keywords

implicit enumerationnonconvex programmingbranch and boundconstrained global optimizationcutsnonlinear dualityreverse convex constraintsKuhn-Tucker-Lagrange optimality conditions

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Recommendations

• scientific article; zbMATH DE number 5151078
• scientific article; zbMATH DE number 416855
• On the convexification of nonlinear programming problems: An applications-oriented survey
• scientific article; zbMATH DE number 888823
• scientific article; zbMATH DE number 929641
• An approach to solving convex programs with nonsmooth objectives
• Nonconvex Structures in Nonlinear Programming
• scientific article; zbMATH DE number 4076972
• scientific article; zbMATH DE number 1215173
• Approximation to nonproper problems of convex programming

Cited in

(3)

• Constrained global optimization: algorithms and applications
• scientific article; zbMATH DE number 3939107 (Why is no real title available?)
• Optimization over the efficient set of a parametric multiple objective linear programming problem

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