A characterization of proper minimal points as solutions of sublinear optimization problems
From MaRDI portal
Publication:1310861
DOI10.1006/jmaa.1993.1303zbMath0802.49003OpenAlexW2081243124MaRDI QIDQ1310861
Jerald P. Dauer, Ossama A. Saleh
Publication date: 13 January 1994
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.1993.1303
Existence of solutions for minimax problems (49J35) Existence theories for problems in abstract spaces (49J27)
Related Items (21)
On the existence and stability of approximate solutions of perturbed vector equilibrium problems ⋮ Minimization of Gerstewitz functionals extending a scalarization by Pascoletti and Serafini ⋮ Remarks on some variants of minimal point theorem and Ekeland variational principle with applications ⋮ Nearly subconvexlike set-valued maps and vector optimization problems ⋮ Super Efficiency in Vector Optimization ⋮ On the generalized Fritz John optimality conditions of vector optimization with set-valued maps under Benson proper efficiency ⋮ On some methods to derive necessary and sufficient optimality conditions in vector optimization ⋮ Duality results for generalized vector variational inequalities with set-valued maps ⋮ Subdifferential calculus for set-valued mappings and optimality conditions for multiobjective optimization problems ⋮ Moreau-Rockafellar theorems for nonconvex set-valued maps ⋮ ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps ⋮ Approximate duality for vector quasi-equilibrium problems and applications ⋮ Ekeland's principle and nuclear cones: a geometrical aspect ⋮ New generalized convexity notion for set-valued maps and application to vector optimization ⋮ Characterization of properly optimal elements with variable ordering structures ⋮ Strong Duality with Proper Efficiency in Multiobjective Optimization Involving Nonconvex Set-Valued Maps ⋮ Approximate Benson efficient solutions for set-valued equilibrium problems ⋮ Duality for vector optimization problems via a general scalarization ⋮ Existence and characterization theorems in nonconvex vector optimization ⋮ Optimality conditions for vector optimization problems of a difference of convex mappings ⋮ Optimality conditions for D.C. vector optimization problems under reverse convex constraints
This page was built for publication: A characterization of proper minimal points as solutions of sublinear optimization problems
