Abstract
In the previous chapter, we study the minimization problem of a convex function under convex constraints. In this chapter, we study the minimization problem for two other classes of functions. The first ones are quasi-convex functions. We know (see Chapter 5) that for a convex function f, any level set of f is convex. But the converse is not true. The functions which have the property that every level set is convex are precisely called quasi-convex functions. In the first section we give necessary and sufficient conditions for a point to be a solution to a minimization problem of a quasi-convex function under convex constraints.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
