![Sample our Engineering & Technology journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5933/TOC-Subject-Sample-2021-Engineering-Tech.jpg"})
Abstract
In this paper, we propose necessary/sufficient conditions for existence of minimizers of nonconvex cubic programming problems via an Eaves type theorem. Directional differentiability of the optimal value function under total perturbation are characterized. Among our proposed assumptions, there are some weaker than the existing assumptions (applied to cubic programming).
Acknowledgements
This research is funded by the Ministry of Education and Training of Vietnam [grant number B2019-SP2-01].
Disclosure statement
No potential conflict of interest was reported by the author(s).
Additional information
Funding
This research is funded by the Ministry of Education and Training of Vietnam [grant number B2019-SP2-01].