A specialization of the convex simplex method to cubic programming
From MaRDI portal
Publication:3958278
DOI10.1007/BF02089026zbMath0494.90061MaRDI QIDQ3958278
Claude G. Henin, Jerome Doutriaux
Publication date: 1980
Published in: Rivista di Matematica per le Scienze Economiche e Sociali (Search for Journal in Brave)
convergenceportfolio selectioncomputation timeconvex simplex methodagricultural researchcubic objective functionscubic utility functions
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
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 ⋮ Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables
This page was built for publication: A specialization of the convex simplex method to cubic programming
