Abstract

We study nonsmooth multiobjective programming problems involving locally Lipschitz functions and support functions. Two types of Karush-Kuhn-Tucker optimality conditions with support functions are introduced. Sufficient optimality conditions are presented by using generalized convexity and certain regularity conditions. We formulate Wolfe-type dual and Mond-Weir-type dual problems for our nonsmooth multiobjective problems and establish duality theorems for (weak) Pareto-optimal solutions under generalized convexity assumptions and regularity conditions.

Highlights

  • Multiobjective programming problems arise when more than one objective function is to be optimized over a given feasible region

  • Majumdar gave sufficient optimality conditions for differentiable multiobjective programming which modified those given in Singh under the assumption of convexity, pseudoconvexity, and quasiconvexity of the functions involved at the Pareto-optimal solution

  • We introduce nonsmooth multiobjective programming problems involving locally Lipschitz functions and support functions for inequality and equality constraints

Read more

Summary

Introduction

Multiobjective programming problems arise when more than one objective function is to be optimized over a given feasible region. Majumdar gave sufficient optimality conditions for differentiable multiobjective programming which modified those given in Singh under the assumption of convexity, pseudoconvexity, and quasiconvexity of the functions involved at the Pareto-optimal solution. Journal of Inequalities and Applications nonsmooth multiobjective programming problems involving locally Lipschitz functions for inequality and equality constraints. They extended sufficient optimality conditions in Kim et al 13 to the nonsmooth case and established duality theorems for nonsmooth multiobjective programming problems involving locally Lipschitz functions. We introduce nonsmooth multiobjective programming problems involving locally Lipschitz functions and support functions for inequality and equality constraints. We propose a Wolfe-type dual and a Mond-Weir-type dual for the primal problem and establish duality results between the primal problem and its dual problems under generalized convexity and regularity conditions

Notation and Definitions
Sufficient Optimality Conditions
Duality

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.