Abstract

Necessary conditions for Pareto optimality in multiobjective programming with subdifferentiable set functions are established in Theorem 12 of H. C. Lai and L. J. Lin (J. Math. Anal. Appl.132,1988, 558–571). In this paper, we establish some sufficient conditions under which a feasible solution of such a problem will be Pareto optimal provided that a weaker convexity requirement is satisfied; for instance (I,ρ,θ)-convexity is assumed for both objective and constraint set functions. Some duality models are also discussed. Wolfe-type and Mond–Weir-type duality theorems are proved.

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.