Abstract

Quasiconvexity for mappings is generalized in such a way that this notion gives the sufficiency of necessary optimality conditions such as multiplier rules. One can show that it is the weakest type of generalized convexity notions in the sense that this generalized quasiconvexity holds if certain multiplier rules are sufficient for optimality. It also yields the equivalence of local and global minima. The theory is applied to a mufti-objective programming problem and a vector approximation problem.

Full Text
Paper version not known

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

Disclaimer: 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.