scholarly journals Generalized -Type I Univex Functions in Multiobjective Optimization

2012 ◽  
Vol 2012 ◽  
pp. 1-13
Author(s):  
Pallavi Kharbanda ◽  
Divya Agarwal ◽  
Deepa Sinha
Keyword(s):  
Multiobjective Programming ◽  
Generalized Functions ◽  
Sufficient Optimality Conditions ◽  
Type I ◽  
Duality Theorems ◽  
New Class ◽  
Nonsmooth Multiobjective Programming ◽  
Strong Converse ◽  
Multiobjective Programming Problem ◽  
Generalized Type

A new class of generalized functions -type I univex is introduced for a nonsmooth multiobjective programming problem. Based upon these generalized functions, sufficient optimality conditions are established. Weak, strong, converse, and strict converse duality theorems are also derived for Mond-Weir-type multiobjective dual program.

scholarly journals Sufficiency and Duality in Nonsmooth Multiobjective Programming Problem under Generalized Univex Functions

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Pallavi Kharbanda ◽  
Divya Agarwal ◽  
Deepa Sinha
Keyword(s):  
Optimality Conditions ◽  
Programming Problem ◽  
Multiobjective Programming ◽  
Generalized Functions ◽  
Sufficient Optimality Conditions ◽  
Type I ◽  
Duality Theorems ◽  
Nonsmooth Multiobjective Programming ◽  
Strong Converse ◽  
Multiobjective Programming Problem

We consider a nonsmooth multiobjective programming problem where the functions involved are nondifferentiable. The class of univex functions is generalized to a far wider class of (φ,α,ρ,σ)-dI-V-type I univex functions. Then, through various nontrivial examples, we illustrate that the class introduced is new and extends several known classes existing in the literature. Based upon these generalized functions, Karush-Kuhn-Tucker type sufficient optimality conditions are established. Further, we derive weak, strong, converse, and strict converse duality theorems for Mond-Weir type multiobjective dual program.

scholarly journals Higher-order duality results for a new class of nonconvex nonsmooth multiobjective programming problems

Filomat ◽  
2019 ◽  
Vol 33 (6) ◽  
pp. 1619-1639
Author(s):  
Tadeusz Antczak ◽  
Hachem Slimani
Keyword(s):  
Multiobjective Programming ◽  
Vector Optimization Problem ◽  
Order Type ◽  
Higher Order ◽  
Type I ◽  
New Class ◽  
Duality Results ◽  
Nonsmooth Multiobjective Programming ◽  
Multiobjective Programming Problem ◽  
Multiobjective Programming Problems

In this paper, a nonconvex nonsmooth multiobjective programming problem is considered and two its higher-order duals are defined. Further, several duality results are established between the considered nonsmooth vector optimization problem and its dual models under assumptions that the involved functions are higher-order (??)-type I functions.

scholarly journals Minimax fractional programming problem involving nonsmooth generalized ?-univex functions

2012 ◽  
Vol 3 (1) ◽  
pp. 7-22 ◽  
Author(s):  
Anurag JAYSWAL ◽  
Rajnish KUMAR ◽  
Dilip KUMAR
Keyword(s):  
Programming Problem ◽  
Fractional Programming ◽  
Sufficient Optimality Conditions ◽  
Type I ◽  
Fractional Programming Problem ◽  
New Class ◽  
Locally Lipschitz ◽  
Minimax Fractional Programming ◽  
Generalized Type ◽  
Appl Math

In this paper, we introduce a new class of generalized ?-univex functions where the involved functions are locally Lipschitz. We extend the concept of ?-type I invex [S. K. Mishra, J. S. Rautela, On nondifferentiable minimax fractional programming under generalized ?-type I invexity, J. Appl. Math. Comput. 31 (2009) 317-334] to ?-univexity and an example is provided to show that there exist functions that are ?-univex but not ?-type I invex. Furthermore, Karush-Kuhn-Tucker-type sufficient optimality conditions and duality results for three different types of dual models are obtained for nondifferentiable minimax fractional programming problem involving generalized ?-univex functions. The results in this paper extend some known results in the literature.

scholarly journals Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions

2017 ◽  
Vol 27 (2) ◽  
pp. 205-218 ◽  
Author(s):  
Yadvendra Singh ◽  
S.K. Mishra ◽  
K.K. Lai
Keyword(s):  
Generalized Convexity ◽  
Multiobjective Programming ◽  
Sufficient Optimality Conditions ◽  
Duality Theorems ◽  
Support Functions ◽  
Primal Problem ◽  
Special Cases ◽  
Multiobjective Programming Problem ◽  
Optimality And Duality ◽  
Convexity Assumptions

In this paper, we consider a nonsmooth semi-infinite multiobjective programming problem involving support functions. We establish sufficient optimality conditions for the primal problem. We formulate Mond-Weir type dual for the primal problem and establish weak, strong and strict converse duality theorems under various generalized convexity assumptions. Moreover, some special cases of our problem and results are presented.

scholarly journals Duality and Lagrange multipliers for nonsmooth multiobjective programming

2006 ◽  
Vol 74 (3) ◽  
pp. 369-383 ◽  
Author(s):  
Houchun Zhou ◽  
Wenyu Sun
Keyword(s):  
Optimality Conditions ◽  
Lagrange Multipliers ◽  
Constraint Qualification ◽  
Multiobjective Programming ◽  
Sufficient Optimality Conditions ◽  
Dual Model ◽  
Mixed Duality ◽  
Nonsmooth Multiobjective Programming ◽  
Necessary And Sufficient ◽  
Dual Models

Without any constraint qualification, the necessary and sufficient optimality conditions are established in this paper for nonsmooth multiobjective programming involving generalised convex functions. With these optimality conditions, a mixed dual model is constructed which unifies two dual models. Several theorems on mixed duality and Lagrange multipliers are established in this paper.

scholarly journals Optimality Conditions and Duality for Multiobjective Variational Problems with Generalized -B-Type-I Functions

2011 ◽  
Vol 2011 ◽  
pp. 1-11 ◽  
Author(s):  
C. Nahak ◽  
N. Behera
Keyword(s):  
Optimality Conditions ◽  
Variational Problems ◽  
Sufficient Optimality Conditions ◽  
Type I ◽  
Duality Results ◽  
Multiobjective Variational Problems ◽  
Generalized Type

We use -type-I and generalized -type-I functions to establish sufficient optimality conditions and duality results for multiobjective variational problems. Some of the related problems are also discussed.

scholarly journals Multiobjective duality with ρ−(η,θ)-invexity

2005 ◽  
Vol 2005 (2) ◽  
pp. 175-180 ◽  
Author(s):  
C. Nahak ◽  
S. Nanda
Keyword(s):  
Programming Problem ◽  
Multiobjective Programming ◽  
Efficient Solutions ◽  
Duality Theorems ◽  
Converse Duality ◽  
Dual Problems ◽  
Properly Efficient Solutions ◽  
Multiobjective Programming Problem ◽  
Primal And Dual Problems ◽  
Primal And Dual

Under ρ−(η,θ)-invexity assumptions on the functions involved, weak, strong, and converse duality theorems are proved to relate properly efficient solutions of the primal and dual problems for a multiobjective programming problem.

Sign in / Sign up

Export Citation Format

Share Document