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).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
