A specialization of the convex simplex method to cubic programming

DOI10.1007/BF02089026MaRDI QIDQ3958278zbMATH OpenFDO

Authors Claude G. Henin, Jerome Doutriaux

Publication date 1980

Published in Rivista di Matematica per le Scienze Economiche e Sociali (Search for Journal in Brave)

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

zbMATH Keywords

agricultural researchcomputation timeconvergenceconvex simplex methodcubic objective functionscubic utility functionsportfolio selection

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Convex programming (90C25) Nonlinear programming (90C30) Applications of mathematical programming (90C90)

Cited in

(3)

• Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables
• Existence and sensitivity analysis for nonconvex cubic optimization problems
• A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables

This page was built for publication: A specialization of the convex simplex method to cubic programming

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