On the public citation graph

Proper solutions of vector optimization problems

0 signed · 61 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-642-46618-2_7openalex-snapshot
Recent Results on Duality in Vector Optimization
inferredcites →https://doi.org/10.1007/978-3-642-50280-4openalex-snapshot
Theory of Vector Optimization
inferredcites →https://doi.org/10.1007/bf00934082openalex-snapshot
On proper and improper efficient solutions of optimal problems with multicriteria
inferredcites →https://doi.org/10.1007/bf00934353openalex-snapshot
Proper efficiency with respect to cones
inferredcites →https://doi.org/10.1007/bf00939770openalex-snapshot
On necessary optimality conditions in vector optimization problems
inferredcites →https://doi.org/10.1007/bf00939804openalex-snapshot
On necessary and sufficient conditions in vector optimization
inferredcites →https://doi.org/10.1007/bf00939823openalex-snapshot
A survey of vector optimization in infinite-dimensional spaces, part 2
inferredcites →https://doi.org/10.1007/bf01719738openalex-snapshot
On the completeness and constructiveness of parametric characterizations to vector optimization problems
inferredcites →https://doi.org/10.1007/bf02594784openalex-snapshot
Duality in vector optimization
inferredcites →https://doi.org/10.1016/0022-247x(68)90201-1openalex-snapshot
Proper efficiency and the theory of vector maximization
inferredcites →https://doi.org/10.1016/0022-247x(79)90226-9openalex-snapshot
An improved definition of proper efficiency for vector maximization with respect to cones
inferredcites →https://doi.org/10.1016/s0076-5392(09)x6017-0openalex-snapshot
Theory of Multiobjective Optimization
inferredcites →https://doi.org/10.1016/s0168-2024(09)x7002-5openalex-snapshot
Theory of Extremal Problems
inferredcites →https://doi.org/10.1073/pnas.39.1.42openalex-snapshot
Minimax Theorems
inferredcites →https://doi.org/10.1080/02331937708842405openalex-snapshot
Basic properties of scalarizmg functionals for multiobjective optimization
inferredcites →https://doi.org/10.1080/02331938008842650openalex-snapshot
The geometry of Pareto efficiency over cones
inferredcites →https://doi.org/10.1137/0134018openalex-snapshot
On Cone-Efficiency, Cone-Convexity and Cone-Compactness
inferredcites →https://doi.org/10.1137/0315004openalex-snapshot
Proper Efficient Points for Maximizations with Respect to Cones
inferredcites →https://doi.org/10.1287/opre.15.3.570openalex-snapshot
Letter to the Editor—Improper Solutions of the Vector Maximum Problem
inferredcites →https://doi.org/10.1525/9780520411586openalex-snapshot
Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability
inferredcites →https://doi.org/10.2307/2342801openalex-snapshot
Studies in Linear and Non-Linear Programming.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/0-306-48107-3_2openalex-snapshot
Nonlinear Multiobjective Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-46854-4_20openalex-snapshot
Sensitivity in Multiobjective Programming by Differential Equations Methods. The case of Homogeneous Functions
inferred← citeshttps://doi.org/10.1007/bf02190008openalex-snapshot
Relationship between solid cones and cones with bases
inferred← citeshttps://doi.org/10.1007/bf02192045openalex-snapshot
Invex-convexlike functions and duality
inferred← citeshttps://doi.org/10.1007/bf02192200openalex-snapshot
Directionally differentiable multiobjective optimization involving discrete inclusions
inferred← citeshttps://doi.org/10.1007/bf02192569openalex-snapshot
Sufficient optimality conditions and duality in vector optimization with invex-convexlike functions
inferred← citeshttps://doi.org/10.1007/bf02579060openalex-snapshot
Duality and saddle-points for convex-like vector optimization problems on real linear spaces
inferred← citeshttps://doi.org/10.1007/s10898-013-0077-7openalex-snapshot
Higher-order optimality conditions for proper efficiency in nonsmooth vector optimization using radial sets and radial derivatives
inferred← citeshttps://doi.org/10.1007/s10898-019-00772-3openalex-snapshot
Variants of the Ekeland variational principle for approximate proper solutions of vector equilibrium problems
inferred← citeshttps://doi.org/10.1007/s10898-022-01129-zopenalex-snapshot
Quasi-contingent derivatives and studies of higher-orders in nonsmooth optimization
inferred← citeshttps://doi.org/10.1007/s10957-004-1184-xopenalex-snapshot
Proper Efficiency in Vector Optimization on Real Linear Spaces
inferred← citeshttps://doi.org/10.1007/s10957-008-9414-2openalex-snapshot
Higher-Order Variational Sets and Higher-Order Optimality Conditions for Proper Efficiency in Set-Valued Nonsmooth Vector Optimization
inferred← citeshttps://doi.org/10.1007/s10957-013-0424-3openalex-snapshot
On Higher-Order Sensitivity Analysis in Nonsmooth Vector Optimization
inferred← citeshttps://doi.org/10.1007/s10957-020-01654-5openalex-snapshot
New Higher-Order Strong Karush–Kuhn–Tucker Conditions for Proper Solutions in Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1007/s11117-015-0330-zopenalex-snapshot
First and second-order optimality conditions without differentiability in multivalued vector optimization
inferred← citeshttps://doi.org/10.1007/s11117-015-0341-9openalex-snapshot
Continuity properties of solution maps of parametric lexicographic equilibrium problems
inferred← citeshttps://doi.org/10.1007/s11228-021-00595-zopenalex-snapshot
On Necessary Optimality Conditions with Higher-Order Complementarity Slackness for Set-Valued Optimization Problems
inferred← citeshttps://doi.org/10.1007/s11590-019-01529-3openalex-snapshot
On the Mangasarian–Fromovitz constraint qualification and Karush–Kuhn–Tucker conditions in nonsmooth semi-infinite multiobjective programming
inferred← citeshttps://doi.org/10.1007/s40324-023-00344-2openalex-snapshot
Set-valued parametric optimization problems with higher-order $$\rho $$-cone arcwise connectedness
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.01.024openalex-snapshot
Optimality conditions under relaxed quasiconvexity assumptions using star and adjusted subdifferentials
inferred← citeshttps://doi.org/10.1016/j.na.2011.07.055openalex-snapshot
Higher-order radial derivatives and optimality conditions in nonsmooth vector optimization
inferred← citeshttps://doi.org/10.1016/s0252-9602(08)60043-0openalex-snapshot
Characterization of Solid Cones
inferred← citeshttps://doi.org/10.1017/s144618110001316xopenalex-snapshot
A notion of local proper efficiency in the Borwein sense in vector optimisation
inferred← citeshttps://doi.org/10.1023/a:1017519922669openalex-snapshot
Optimality Conditions for C1,1 Vector Optimization Problems
inferred← citeshttps://doi.org/10.1023/a:1017574123926openalex-snapshot
On Solidness of Polar Cones
inferred← citeshttps://doi.org/10.1023/a:1022114319999openalex-snapshot
Optimality Conditions for C 1,1 Constrained Multiobjective Problems
inferred← citeshttps://doi.org/10.1023/a:1025495204834openalex-snapshot
Order-Preserving Transformations and Applications
inferred← citeshttps://doi.org/10.1023/b:jota.0000037602.13941.edopenalex-snapshot
Proper Efficiency in Vector Optimization on Real Linear Spaces
inferred← citeshttps://doi.org/10.1080/02331934.2014.886036openalex-snapshot
Optimality conditions and duality for nonsmooth vector equilibrium problems with constraints
inferred← citeshttps://doi.org/10.1080/02331934.2022.2041012openalex-snapshot
Proper efficiency in linear fractional vector optimization via Benson's characterization
inferred← citeshttps://doi.org/10.1080/02331934.2023.2168871openalex-snapshot
Special issue dedicated to the 75th birthday of professor Phan Quoc Khanh
inferred← citeshttps://doi.org/10.1080/02331939508844099openalex-snapshot
Proper efficiency conditions and duality models for constrained multiobjective optimal control probelms containing arbitrary norms
inferred← citeshttps://doi.org/10.1080/02331939608844193openalex-snapshot
Continuous-time multiobjective fractional programming
inferred← citeshttps://doi.org/10.1080/09720510.1998.10700977openalex-snapshot
Proper efficiency principles and duality models for a class of continuous-time multiobjective fractional programming problems with operator constraints
inferred← citeshttps://doi.org/10.1080/09720510.1998.10700984openalex-snapshot
Proper efficiency conditions and duality models for a class of nonsmooth continuous-time multiobjective programming problems
inferred← citeshttps://doi.org/10.1080/09720510.2003.10701075openalex-snapshot
A method for calculating subdifferential of convex vector functions
inferred← citeshttps://doi.org/10.1137/0331029openalex-snapshot
Optimality Conditions via Norm Scalarization in Vector Optimization
inferred← citeshttps://doi.org/10.1186/s13660-022-02792-2openalex-snapshot
Using ρ-cone arcwise connectedness on parametric set-valued optimization problems
inferred← citeshttps://doi.org/10.58250/jnanabha.2021.51101openalex-snapshot
PARAMETRIC SET-VALUED OPTIMIZATION PROBLEMS UNDER GENERALIZED CONE CONVEXITY
inferred← citeshttps://doi.org/10.68381/jca14020openalex-snapshot
Weak and Proper Efficiency in Set-Valued Optimization on Real Linear Spaces
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.