In this paper, we establish sufficient Karush–Kuhn–Tucker (for short, KKT) conditions of a set-valued semi-infinite programming problem (SP) via the notion of contingent epiderivative of set-valued maps. We also derive duality results of Mond–Weir (MWD), Wolfe (WD), and mixed (MD) types of the problem (SP) under ρ-cone arcwise connectedness assumptions.
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.
AbstractIdentities that relate projections of Raviart–Thomas finite element vector fields to discrete gradients of Crouzeix–Raviart finite element functions are derived under general conditions. Various implications such as discrete convex duality results and a characterization of the image of the projection of the Crouzeix–Ravaiart space onto elementwise constant functions are deduced.
In the article, a semi-infinite fractional optimization model having multiple objectives is first formulated. Due to the presence of support functions in each numerator and denominator with constraints, the model so constructed is also non-smooth. Further, three different types of dual models viz Mond -Weir, Wolfe and Schaible are presented and then usual duality results are proved using higher-order [[EQUATION]] convexity assumptions. To show the existence of such generalized convex functions, a nontrivial example has also been exemplified. Moreover, numerical examples have been illustrated at suitable places to justify various results presented in the paper. The formulation and duality results discussed also generalize the well known results appeared in the literature.
The present paper deals with a duality study associated with a new class of multiobjective optimization problems that include the interval-valued components of the ratio vector. More precisely, by using the new notion of (ρ,ψ,d)-quasiinvexity associated with an interval-valued multiple-integral functional, we formulate and prove weak, strong, and converse duality results for the considered class of variational control problems.
In this paper, by using the new concept of (ϱ,ψ,ω)-quasiinvexity associated with interval-valued path-independent curvilinear integral functionals, we establish some duality results for a new class of multiobjective variational control problems with interval-valued components. More concretely, we formulate and prove weak, strong, and converse duality theorems under (ϱ,ψ,ω)-quasiinvexity hypotheses for the considered class of optimization problems.
Duality theory plays an important role in optimization theory. It has been
extensively used for many theoretical and computational problems in
mathematical programming. In this paper duality results are established
for first and second order Wolfe and Mond-Weir type symmetric dual programs
over general polyhedral cones in complex spaces. Corresponding duality
relations for nondifferentiable case are also stated. This work will also
remove inconsistencies in the earlier work from the literature.
On Constrained Set-Valued Semi-Infinite Programming Problems with ρ-Cone Arcwise Connectedness
