Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Constraint Qualifications and Optimality Criteria for Nonsmooth Multiobjective Mathematical Programming Problems with Equilibrium Constraints on Hadamard Manifolds
View through CrossRef
In this article, we investigate nonsmooth multiobjective mathematical programming problems with equilibrium constraints (NMMPEC) in the framework of Hadamard manifolds. Corresponding to (NMMPEC), the generalized Guignard constraint qualification (GGCQ) is introduced in the Hadamard manifold setting. Further, Karush-Kuhn-Tucker (KKT) type necessary criteria of Pareto-efficiency are derived for (NMMPEC). Subsequently, we introduce several (NMMPEC)-tailored constraint qualifications. We establish several interesting interrelations between these constraint qualifications. Moreover, we deduce that these constraint qualifications are sufficient conditions for (GGCQ). We have furnished non-trivial numerical examples in the setting of some well-known manifolds to illustrate the significance of our results. To the best of our knowledge, constraint qualifications and optimality conditions for (NMMPEC) have not yet been studied in the Hadamard manifold setting.
Title: Constraint Qualifications and Optimality Criteria for Nonsmooth Multiobjective Mathematical Programming Problems with Equilibrium Constraints on Hadamard Manifolds
Description:
In this article, we investigate nonsmooth multiobjective mathematical programming problems with equilibrium constraints (NMMPEC) in the framework of Hadamard manifolds.
Corresponding to (NMMPEC), the generalized Guignard constraint qualification (GGCQ) is introduced in the Hadamard manifold setting.
Further, Karush-Kuhn-Tucker (KKT) type necessary criteria of Pareto-efficiency are derived for (NMMPEC).
Subsequently, we introduce several (NMMPEC)-tailored constraint qualifications.
We establish several interesting interrelations between these constraint qualifications.
Moreover, we deduce that these constraint qualifications are sufficient conditions for (GGCQ).
We have furnished non-trivial numerical examples in the setting of some well-known manifolds to illustrate the significance of our results.
To the best of our knowledge, constraint qualifications and optimality conditions for (NMMPEC) have not yet been studied in the Hadamard manifold setting.
Related Results
Riemannian Curvature of a Sliced Contact Metric Manifold
Riemannian Curvature of a Sliced Contact Metric Manifold
Contact geometry become a more important issue in the mathematical world with the works which had done in the 19th century. Many mathematicians have made studies on contact manifol...
Robust Optimality and Duality for Nonsmooth Multiobjective Programming Problems with Vanishing Constraints under Data Uncertainty
Robust Optimality and Duality for Nonsmooth Multiobjective Programming Problems with Vanishing Constraints under Data Uncertainty
This article investigates robust optimality and duality for a class of nonsmooth multiobjective programming problems with vanishing constraints under data uncertainty (in short, UN...
LVM manifolds and lck metrics
LVM manifolds and lck metrics
Abstract
In this paper, we compare two type of complex non-Kähler manifolds : LVM and lck manifolds. First, lck manifolds (for locally conformally Kähler manifolds) admit a...
Duality for a class of nonsmooth multiobjective programming problems using convexificators
Duality for a class of nonsmooth multiobjective programming problems using convexificators
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 cond...
Programming with Constraints
Programming with Constraints
The job of the constraint programmer is to use mathematical constraints to model real world constraints and objects. In this book, Kim Marriott and Peter Stuckey provide the first ...
Optimality and Constraint Qualifications in Vector Optimization
Optimality and Constraint Qualifications in Vector Optimization
We propose a unifying approach in deriving constraint qualifications and theorem
of the alternative. We first introduce a separation theorem between a subspace and
the non-positive...
Programming model abstractions for optimizing I/O intensive applications
Programming model abstractions for optimizing I/O intensive applications
This thesis contributes from the perspective of task-based programming models to the efforts of optimizing I/O intensive applications. Throughout this thesis, we propose programmin...
Some new series of Hadamard matrices
Some new series of Hadamard matrices
AbstractThe purpose of this paper is to prove (1) if q ≡ 1 (mod 8) is a prime power and there exists a Hadamard matrix of order (q − 1)/2, then we can construct a Hadamard matrix o...