Duality theorems for nondifferentiable semi-infinite interval-valued optimization problems with vanishing constraints

In this paper, we study the duality theorems of a nondifferentiable semi-infinite interval-valued optimization problem with vanishing constraints (IOPVC). By constructing the Wolfe and Mond–Weir type dual models, we give the weak duality, strong duality, converse duality, restricted converse duality, and strict converse duality theorems between IOPVC and its corresponding dual models under the assumptions of generalized convexity.

On a Dual Pair of Multiobjective Interval-Valued 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.

Optimality and duality for nonsmooth semi-infinite mathematical program with equilibrium constraints involving generalized invexity of order σ > 0

In this paper, we derive sufficient condition for global optimality for a nonsmooth semi-infinite mathematical program with equilibrium constraints involving generalized invexity of order σ > 0 assumptions. We formulate the Wolfe and Mond-Weir type dual models for the problem using convexificators. We establish weak, strong and strict converse duality theorems to relate the semi-infinite mathematical program with equilibrium constraints and the dual models in the framework of convexificators.

Mixed Type Nondifferentiable Higher-Order Symmetric Duality over Cones

A new mixed type nondifferentiable higher-order symmetric dual programs over cones is formulated. As of now, in the literature, either Wolfe-type or Mond–Weir-type nondifferentiable symmetric duals have been studied. However, we present a unified dual model and discuss weak, strong, and converse duality theorems for such programs under higher-order F - convexity/higher-order F - pseudoconvexity. Self-duality is also discussed. Our dual programs and results generalize some dual formulations and results appeared in the literature. Two non-trivial examples are given to show the uniqueness of higher-order F - convex/higher-order F - pseudoconvex functions and existence of higher-order symmetric dual programs.

Duality for a class of second order symmetric nondifferentiable fractional variational problems

The present work frames a pair of symmetric dual problems for second order nondifferentiable fractional variational problems over cone constraints with the help of support functions. Weak, strong and converse duality theorems are derived under second order F-convexity assumptions. By removing time dependency, static case of the problem is obtained. Suitable numerical example is constructed.

Efficiency and duality for vector optimization problem on Riemannian manifolds involving KT-B-invexity

In this paper, we consider a vector optimization problem on Riemannian manifolds for which we define KT-B-invex and KT-B-pseudoinvex functions. Further, we prove that every vector Kuhn–Tucker point is a weak efficient solution for considered vector optimization problem under the suitable assumptions. Moreover, we also study the Mond–Weir dual problem for the aforesaid problem and establish its weak, strong and converse duality results.

Nondifferentiable G-Mond–Weir Type Multiobjective Symmetric Fractional Problem and Their Duality Theorems under Generalized Assumptions

In this article, a pair of nondifferentiable second-order symmetric fractional primal-dual model (G-Mond–Weir type model) in vector optimization problem is formulated over arbitrary cones. In addition, we construct a nontrivial numerical example, which helps to understand the existence of such type of functions. Finally, we prove weak, strong and converse duality theorems under aforesaid assumptions.

Duality Results in Quasiinvex Variational Control Problems with Curvilinear Integral Functionals

In this paper, we formulate and prove weak, strong and converse duality results invariational control problems involving (ρ,b)-quasiinvex path-independent curvilinear integralcost functionals.

Second-order symmetric duality in multiobjective variational problems

In this work, we introduce a pair of multiobjective second-order symmetric dual variational problems. Weak, strong, and converse duality theorems for this pair are established under the assumption of ?-bonvexity/?-pseudobonvexity. At the end, the static case of our problems has also been discussed.

On Nonsmooth Semi-Infinite Minimax Programming Problem with(Φ,ρ)-Invexity

We are interested in a nonsmooth minimax programming Problem (SIP). Firstly, we establish the necessary optimality conditions theorems for Problem (SIP) when using the well-known Caratheodory's theorem. Under the Lipschitz(Φ,ρ)-invexity assumptions, we derive the sufficiency of the necessary optimality conditions for the same problem. We also formulate dual and establish weak, strong, and strict converse duality theorems for Problem (SIP) and its dual. These results extend several known results to a wider class of problems.