Multiobjective Semi-infinite Programming Problems Research Articles

Efficiency conditions and duality for multiobjective semi-infinite programming problems on Hadamard manifolds

Efficiency conditions and duality for multiobjective semi-infinite programming problems on Hadamard manifolds

Lagrange Duality and Saddle Point Optimality Conditions for Multiobjective Semi-Infinite Programming with Vanishing Constraints

The objective of this paper is to investigate multiobjective semi-infinite programming problems with vanishing constraints (in brief, MSIPVC). We firstly propose both the vector Lagrange dual problems and the scalarized Lagrange dual problems for MSIPVC and explore duality relations under convexity assumptions. Then, the saddle point optimality conditions for MSIPVC are considered. Some examples are also given to illuminate the main results.

Optimality conditions and duality for nonsmooth multiobjective semi-infinite programming problems with vanishing constraints on Hadamard manifolds

This article is concerned with nonsmooth multiobjective semi-infinite programming problems with vanishing constraints in the setting of Hadamard manifolds (abbreviated as, (NMSIPVC)). We present the Abadie constraint qualification (abbreviated as, (ACQ)) and a modified version of (ACQ), namely, (NMSIPVC)-tailored Abadie constraint qualification (abbreviated as, (NMSIPVC-ACQ)), for (NMSIPVC). The Karush-Kuhn-Tucker (abbreviated as, KKT) type necessary criteria of optimality for (NMSIPVC) are derived by employing (ACQ) and (NMSIPVC-ACQ). Moreover, sufficient criteria of optimality for (NMSIPVC) are derived under generalized geodesic convexity hypotheses and certain mild restrictions on the index sets. Further, we formulate Wolfe type and Mond-Weir type dual models related to (NMSIPVC) and derive several duality results that relate (NMSIPVC) and the corresponding dual models. Non-trivial numerical examples are incorporated to demonstrate the validity of the results established in this paper. To the best of our knowledge, this is for the first time that constraint qualifications, optimality conditions, and duality results have been investigated for (NMSIPVC) in the setting of Hadamard manifolds.

Second-Order Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming Problems on Hadamard Manifolds

This paper is devoted to the study of multiobjective semi-infinite programming problems on Hadamard manifolds. We consider a class of multiobjective semi-infinite programming problems (abbreviated as MSIP) on Hadamard manifolds. We use the concepts of second-order Karush–Kuhn–Tucker stationary point and second-order Karush–Kuhn–Tucker geodesic pseudoconvexity of the considered problem to derive necessary and sufficient second-order conditions of efficiency, weak efficiency and proper efficiency for MSIP along with certain generalized geodesic convexity assumptions. Moreover, we formulate the second-order Mond–Weir-type dual problem related to MSIP and deduce weak and strong duality theorems relating MSIP and the dual problem. The significance of our results is demonstrated with the help of non-trivial examples. To the best of our knowledge, this is the first time that second-order optimality conditions for MSIP have been studied in Hadamard manifold setting.

Optimality Conditions and Duality for Nonsmooth Multiobjective Semi-infinite Programming Problems on Hadamard Manifolds

Optimality Conditions and Duality for Nonsmooth Multiobjective Semi-infinite Programming Problems on Hadamard Manifolds

On nonsmooth multiobjective semi-infinite programming with switching constraints using tangential subdifferentials

We investigate optimality conditions for a nonsmooth multiobjective semi-infinite programming problem subject to switching constraints. In particular, we employ a surrogate problem and a suitable constraint qualification to state necessary M-stationary conditions in terms of tangential subdifferentials. An example is given at the end to illustrate our main result.

Optimality conditions and duality for multiobjective semi-infinite programming problems on Hadamard manifolds using generalized geodesic convexity

This paper deals with multiobjective semi-infinite programming problems on Hadamard manifolds. We establish the sufficient optimality criteria of the considered problem under generalized geodesic convexity assumptions. Moreover, we formulate the Mond-Weir and Wolfe type dual problems and derive the weak, strong and strict converse duality theorems relating the primal and dual problems under generalized geodesic convexity assumptions. Suitable examples have also been given to illustrate the significance of these results. The results presented in this paper extend and generalize the corresponding results in the literature.

Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data

In this article, some Karush-Kuhn-Tucker type robust optimality conditions and duality for an uncertain nonsmooth multiobjective fractional semi-infinite programming problem ((UMFP), for short) are established. First, we provide, by combining robust optimization and the robust limiting constraint qualification, robust necessary optimality conditions in terms of Mordukhovich's subdifferentials. Under suitable assumptions on the generalized convexity/the strictly generalized convexity, robust necessary optimality condition becomes robust sufficient optimality condition. Second, we formulate types of Mond-Weir and Wolfe robust dual problem for (UMFP) via the Mordukhovich subdifferentials. Finally, as an application, we establish weak/strong/converse robust duality theorems for the problem (UMFP) and its Mond-Weir and Wolfe types dual problem. Some illustrative examples are also provided for our findings.

Karush-Kuhn-Tucker optimality conditions and duality for nonsmooth multiobjective semi-infinite programming problems with vanishing constraints

Karush-Kuhn-Tucker optimality conditions and duality for nonsmooth multiobjective semi-infinite programming problems with vanishing constraints

Necessary optimality conditions for a multiobjective semi-infinite interval-valued programming problem

Necessary optimality conditions for a multiobjective semi-infinite interval-valued programming problem

Mixed Type Duality for Nonsmooth Multiobjective Semi-Infinite Programming Problems

The mixed type duality for nonsmooth multiobjective semi-infinite programming problems was studied. Firstly, by the Lagrange function, the definitions of weakly efficient solutions and efficient solutions to the mixed type duality were introduced. Secondly, by means of the Dini-pseudoconvexity, the weak duality theorems, the strong duality theorems and the converse duality theorems were obtained. The results generalize the main results in previous literatures.

Higher-order Karush–Kuhn–Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming

ABSTRACT The notions of higher-order Studniarski derivative and m-stable functions (m is a positive integer) are introduced for dealing with multiobjective semi-infinite programming problem with inequality constraints. In order to obtain results on necessary optimality conditions of higher order, we study two generalized Abadie constraint qualifications for these notions together with the existence results of Studniarski derivative of higher order. An application of these constraint qualifications for the Borwein properly efficient solution on weak and strong Karush–Kuhn–Tucker necessary optimality conditions via the higher-order Studniarski derivatives with m-stable functions is presented. A higher-order sufficient optimality condition which is very close to higher-order strong Karush–Kuhn–Tucker necessary conditions to such problem is provided as well. Several examples are also constructed to illustrate the main results of the paper.

Weak Slater Qualification for Nonconvex Multiobjective Semi-infinite Programming

We consider a nonsmooth multiobjective semi-infinite programming problem with a feasible set defined by inequality constraints, MSIP for short. First, we introduce the weak Slater constraint qualification and derive the Karush–Kuhn–Tucker types necessary and sufficient conditions for (weakly, properly) efficient solution of the considered problem. Then, we introduce a dual of Mond–Weir type and present (weak and strong) duality results for MSIP. All results are given in terms of Clarke subdifferential.

Strong Karush–Kuhn–Tucker optimality conditions for multiobjective semi-infinite programming via tangential subdifferential

The main aim of this paper is to study strong Karush–Kuhn–Tucker (KKT) optimality conditions for nonsmooth multiobjective semi-infinite programming (MSIP) problems. By using tangential subdifferential and suitable regularity conditions, we establish some strong necessary optimality conditions for some types of efficient solutions of nonsmooth MSIP problems. In addition to the theoretical results, some examples are provided to illustrate the advantages of our outcomes.

Duality models for multiobjective semiinfinite fractional programming problems involving type-I and related functions

In this paper, we consider several dual models for a multiobjective semiinfinite fractional programming problem and establish usual duality theorems involving type-I and related functions. Our results generalize the results of Zalmai and Zhang [G.J. Zalmai and Qing-hong Zhang, Parametric duality models for semiinfinite multiobjective fractional programming problems containing generalized (α, η, ρ)-V-invex functions, Acta Math. Appl. Sinica 29(2) (2013), 225–240]. Results obtained in this paper extend and unify several results in the literature.

Isolated efficiency in nonsmooth semi-infinite multi-objective programming

ABSTRACTIn this paper, isolated efficient solutions of a given nonsmooth Multi-Objective Semi-Infinite Programming problem (MOSIP) are studied. Two new Data Qualifications (DQs) are introduced and it is shown that these DQs are, to a large extent, weaker than already known Constraint Qualifications (CQs). The relationships between isolated efficiency and some relevant notions existing in the literature, including robustness, are established. Various necessary and sufficient conditions for characterizing isolated efficient solutions of a general problem are derived. It is done invoking the tangent cones, the normal cones, the generalized directional derivatives, and some gap functions. Using these characterizations, the (strongly) perturbed Karush-Kuhn-Tucker (KKT) optimality conditions for MOSIP are analyzed. Furthermore, it is shown that each isolated efficient solution is a Geoffrion properly efficient solution under appropriate assumptions. Moreover, Kuhn-Tucker (KT) and Klinger properly efficient solutions for a nonsmooth MOSIP are defined and it is proved that each isolated efficient solution is a KT properly efficient solution in general, and a Klinger properly efficient solution under a DQ. Finally, in the last section, the largest isolated efficiency constant for a given isolated efficient solution is determined.

Duality for non-differentiable multi-objective semi-infinite programming for higher order invex functions

This paper deals with non-differentiable multi-objective semi-infinite programming problem. It is a problem of simultaneous minimisation of finitely many scalar valued functions subject to an arbitrary (possibly infinite) set of constraints. Non-differentiability enters, due to the square root of a quadratic form which appears in the objective functional. Concept of efficiency of order m has been extended to the above stated problem. In order to study this new solution concept, the notion of ρ-invexity of order m is also proposed which is utilised to establish sufficient optimality conditions for the non-differentiable multi-objective semi-infinite programming problem. Mond-Weir type of dual is proposed for which weak, strong and strict converse duality theorems are established.

On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints

In this paper, we consider a nonsmooth multiobjective semi-infinite programming problem with vanishing constraints (MOSIPVC). We introduce stationary conditions for the MOSIPVCs and establish the strong Karush-Kuhn-Tucker type sufficient optimality conditions for the MOSIPVC under generalized convexity assumptions.

Necessary and Sufficient Conditions for (Weakly) Efficient of Non-Differentiable Multi-Objective Semi-Infinite Programming Problems

We consider a multi-objective semi-infinite programming problem with a feasible set defined by inequality constraints. First, we present a Fritz–John type necessary optimality condition. Then, we introduce two constraint qualifications and derive the weak and strong Karush–Kuhn–Tucker types necessary conditions for (weakly) efficient solution of the considered problem. Finally, an extension of a Caristi–Ferrara–Stefanescu result for the (\(\Phi\), \(\rho\))-invexity is proved, and some sufficient conditions are presented under this weak assumption. All results are given in term of Clarke subdifferential.

Optimality Conditions for Nondifferentiable Multiobjective Semi-Infinite Programming Problems

We have considered a multiobjective semi-infinite programming problem with a feasible set defined by inequality constraints. First we studied a Fritz-John type necessary condition. Then, we introduced two constraint qualifications and derive the weak and strong Karush-Kuhn-Tucker (KKT in brief) types necessary conditions for an efficient solution of the considered problem. Finally an extension of a Caristi-Ferrara-Stefanescu result for the (Φ,ρ)-invexity is proved, and some sufficient conditions are presented under this weak assumption. All results are given in terms of Clark subdifferential.