Abstract
Approximate convex functions are characterised in terms of Clarke generalised gradient. We apply this characterisation to derive optimality conditions for quasi efficient solutions of nonsmooth vector optimisation problems. Two new classes of generalised approximate convex functions are defined and mixed duality results are obtained.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.