Pages that link to "Item:Q377740"
From MaRDI portal
The following pages link to \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints (Q377740):
Displaying 17 items.
- On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data (Q497436) (← links)
- Duality related to approximate proper solutions of vector optimization problems (Q905760) (← links)
- Approximate quasi efficiency of set-valued optimization problems via weak subdifferential (Q1689268) (← links)
- Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs (Q1706408) (← links)
- An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems (Q1990434) (← links)
- Minimax programming as a tool for studying robust multi-objective optimization problems (Q2108806) (← links)
- An approach to characterizing \(\epsilon\)-solution sets of convex programs (Q2146365) (← links)
- Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization (Q2150766) (← links)
- On approximate solutions and saddle point theorems for robust convex optimization (Q2228362) (← links)
- On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives (Q2311119) (← links)
- Some characterizations of approximate solutions for robust semi-infinite optimization problems (Q2664903) (← links)
- On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems (Q2693966) (← links)
- Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials (Q2698576) (← links)
- On a weakly C-$\epsilon$-vector saddle point approach in weak vector problems (Q5244131) (← links)
- On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data (Q6126586) (← links)
- Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data (Q6159528) (← links)
- Approximate optimal solutions for multiobjective optimization problems with infinite constraints (Q6196813) (← links)