scholarly journals Duality for a class of nonsmooth multiobjective programming problems using convexificators

Filomat ◽  
2017 ◽  
Vol 31 (2) ◽  
pp. 489-498 ◽  
Author(s):  
Anurag Jayswal ◽  
Krishna Kummari ◽  
Vivek Singh
Keyword(s):  
Optimality Conditions ◽  
Programming Problem ◽  
Multiobjective Programming ◽  
Optimization Problems ◽  
Duality Results ◽  
Nonsmooth Multiobjective Programming ◽  
Multiobjective Programming Problem ◽  
Multiobjective Programming Problems ◽  
Dual Models

As duality is an important and interesting feature of optimization problems, in this paper, we continue the effort of Long and Huang [X. J. Long, N. J. Huang, Optimality conditions for efficiency on nonsmooth multiobjective programming problems, Taiwanese J. Math., 18 (2014) 687-699] to discuss duality results of two types of dual models for a nonsmooth multiobjective programming problem using convexificators.

Multiobjective Programming

2014 ◽  
pp. 1585-1604
Author(s):  
Minghe Sun
Keyword(s):  
Programming Problem ◽  
Multiobjective Programming ◽  
Optimization Problems ◽  
Optimal Solution ◽  
Objective Functions ◽  
Solution Quality ◽  
Solution Methods ◽  
Multiobjective Programming Problem ◽  
Feasible Solutions ◽  
Multiobjective Programming Problems

Optimization problems with multiple criteria measuring solution quality can be modeled as multiobjective programming problems. Because the objective functions are usually in conflict, there is not a single feasible solution that can optimize all objective functions simultaneously. An optimal solution is one that is most preferred by the decision maker (DM) among all feasible solutions. An optimal solution must be nondominated but a multiobjective programming problem may have, possibly infinitely, many nondominated solutions. Therefore, tradeoffs must be made in searching for an optimal solution. Hence, the DM's preference information is elicited and used when a multiobjective programming problem is solved. The model, concepts and definitions of multiobjective programming are presented and solution methods are briefly discussed. Examples are used to demonstrate the concepts and solution methods. Graphics are used in these examples to facilitate understanding.

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 Optimality conditions and Mond–Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints

4OR ◽  
2021 ◽  
Author(s):  
Tadeusz Antczak
Keyword(s):  
Optimality Conditions ◽  
Vector Optimization ◽  
Multiobjective Programming ◽  
Optimization Problems ◽  
Necessary Optimality Conditions ◽  
Sufficient Optimality Conditions ◽  
Smooth Vector ◽  
Duality Results ◽  
Vanishing Constraints ◽  
Multiobjective Programming Problems

AbstractIn this paper, the class of differentiable semi-infinite multiobjective programming problems with vanishing constraints is considered. Both Karush–Kuhn–Tucker necessary optimality conditions and, under appropriate invexity hypotheses, sufficient optimality conditions are proved for such nonconvex smooth vector optimization problems. Further, vector duals in the sense of Mond–Weir are defined for the considered differentiable semi-infinite multiobjective programming problems with vanishing constraints and several duality results are established also under invexity hypotheses.

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 Multiobjective programming under nondifferentiable G-V-invexity

Filomat ◽  
2016 ◽  
Vol 30 (11) ◽  
pp. 2909-2923 ◽  
Author(s):  
Tadeusz Antczak
Keyword(s):  
Optimality Conditions ◽  
Programming Problem ◽  
Dual Problem ◽  
Multiobjective Programming ◽  
Necessary Optimality Conditions ◽  
Vector Optimization Problem ◽  
Alternative Theorem ◽  
Nonsmooth Multiobjective Programming ◽  
Locally Lipschitz ◽  
Multiobjective Programming Problem

In the paper, new Fritz John type necessary optimality conditions and new Karush-Kuhn-Tucker type necessary opimality conditions are established for the considered nondifferentiable multiobjective programming problem involving locally Lipschitz functions. Proofs of them avoid the alternative theorem usually applied in such a case. The sufficiency of the introduced Karush-Kuhn-Tucker type necessary optimality conditions are proved under assumptions that the functions constituting the considered nondifferentiable multiobjective programming problem are G-V-invex with respect to the same function ?. Further, the so-called nondifferentiable vector G-Mond-Weir dual problem is defined for the considered nonsmooth multiobjective programming problem. Under nondifferentiable G-V-invexity hypotheses, several duality results are established between the primal vector optimization problem and its G-dual problem in the sense of Mond-Weir.

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.

Symmetric duality results for second-order nondifferentiable multiobjective programming problem

2019 ◽  
Vol 53 (2) ◽  
pp. 539-558 ◽  
Author(s):  
Ramu Dubey ◽  
Vishnu Narayan Mishra
Keyword(s):  
Programming Problem ◽  
Duality Theorem ◽  
Multiobjective Programming ◽  
Second Order ◽  
Weak Duality ◽  
Symmetric Duality ◽  
Numerical Examples ◽  
Duality Results ◽  
Duality Relations ◽  
Multiobjective Programming Problem

In this article, we study the existence of Gf-bonvex/Gf -pseudo-bonvex functions and construct various nontrivial numerical examples for the existence of such type of functions. Furthermore, we formulate Mond-Weir type second-order nondifferentiable multiobjective programming problem and give a nontrivial concrete example which justify weak duality theorem present in the paper. Next, we prove appropriate duality relations under aforesaid assumptions.

Sign in / Sign up

Export Citation Format

Share Document