On the public citation graph

On a domination property for vector maximization with respect to cones

https://doi.org/10.1007/bf00934609
0 signed · 41 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-80808-1openalex-snapshot
Linear Multiobjective Programming
inferredcites →https://doi.org/10.1007/bf00932614openalex-snapshot
Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
inferredcites →https://doi.org/10.1007/bf00932634openalex-snapshot
A survey of multicriteria optimization or the vector maximum problem, part I: 1776?1960
inferredcites →https://doi.org/10.1007/bf00932907openalex-snapshot
Connectedness of the set of nondominated outcomes in multicriteria optimization
inferredcites →https://doi.org/10.1007/bf00934353openalex-snapshot
Proper efficiency with respect to cones
inferredcites →https://doi.org/10.1007/bf00934453openalex-snapshot
The structure of admissible points with respect to cone dominance
inferredcites →https://doi.org/10.1007/bf01580111openalex-snapshot
A revised simplex method for linear multiple objective programs
inferredcites →https://doi.org/10.1007/bf01584543openalex-snapshot
Algorithms for the vector maximization problem
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(75)90189-4openalex-snapshot
The set of all nondominated solutions in linear cases and a multicriteria simplex method
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/0022-247x(83)90230-5openalex-snapshot
Efficiency and proper efficiency in vector maximization with respect to cones
inferredcites →https://doi.org/10.1137/0315004openalex-snapshot
Proper Efficient Points for Maximizations with Respect to Cones
inferredcites →https://doi.org/10.1287/opre.22.1.189openalex-snapshot
Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis
inferredcites →https://doi.org/10.1525/9780520411586openalex-snapshot
Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability

What points at this work

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

inferred← citeshttps://doi.org/10.1002/(sici)1099-1360(199612)5:4<271::aid-mcda114>3.0.co;2-wopenalex-snapshot
Approximately Efficient Solutions in Vector Optimization
inferred← citeshttps://doi.org/10.1002/net.21815openalex-snapshot
Extensions of labeling algorithms for multi‐objective uncertain shortest path problems
inferred← citeshttps://doi.org/10.1002/oca.2532openalex-snapshot
Towards multiobjective optimization and control of smart grids
inferred← citeshttps://doi.org/10.1006/jmaa.1997.5550openalex-snapshot
The Domination Property for Efficiency in Locally Convex Spaces
inferred← citeshttps://doi.org/10.1007/0-306-48107-3_2openalex-snapshot
Nonlinear Multiobjective Programming
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_315openalex-snapshot
Multi-Objective Optimization: Pareto Optimal Solutions, Properties
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_426openalex-snapshot
Multi-objective Optimization: Pareto Optimal Solutions, Properties
inferred← citeshttps://doi.org/10.1007/978-1-4757-3623-6_12openalex-snapshot
Efficiency
inferred← citeshttps://doi.org/10.1007/978-3-642-54265-7_2openalex-snapshot
Order Relations and Ordering Cones
inferred← citeshttps://doi.org/10.1007/bf00934467openalex-snapshot
On a domination property for vector maximization with respect to cones
inferred← citeshttps://doi.org/10.1007/bf00936168openalex-snapshot
On the domination property in vector optimization
inferred← citeshttps://doi.org/10.1007/bf01099463openalex-snapshot
A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
inferred← citeshttps://doi.org/10.1007/bf01588781openalex-snapshot
Recession cones and the domination property in vector optimization
inferred← citeshttps://doi.org/10.1007/bf02192940openalex-snapshot
Extension of the Zorn lemma to general nontransitive binary relations
inferred← citeshttps://doi.org/10.1007/s10898-019-00761-6openalex-snapshot
Stability in unified semi-infinite vector optimization
inferred← citeshttps://doi.org/10.1007/s10957-019-01514-xopenalex-snapshot
Stability and Scalarization for a Unified Vector Optimization Problem
inferred← citeshttps://doi.org/10.1007/s10957-024-02446-xopenalex-snapshot
Subdifferentials and Coderivatives of Efficient Point Multifunctions in Parametric Convex Vector Optimization
inferred← citeshttps://doi.org/10.1016/0022-247x(86)90061-2openalex-snapshot
The domination property in multicriteria optimization
inferred← citeshttps://doi.org/10.1016/0377-2217(86)90048-2openalex-snapshot
On efficient sets in vector maximum problems — A brief survey
inferred← citeshttps://doi.org/10.1016/j.jmaa.2012.12.072openalex-snapshot
The domination property for efficiency and Bishop–Phelps theorem in locally convex spaces
inferred← citeshttps://doi.org/10.1016/s0076-5392(09)60314-3openalex-snapshot
References
inferred← citeshttps://doi.org/10.1051/ro/1994280100771openalex-snapshot
Sur la propriété de domination et l'existence de points Pareto-efficaces en optimisation vectorielle convexe
inferred← citeshttps://doi.org/10.1080/02331938808843317openalex-snapshot
On the characterization of efficient points by means of monotone functionals
inferred← citeshttps://doi.org/10.1080/02331938908843500openalex-snapshot
Convexity of the optimal multifunctions and its consequences in vector optimization
inferred← citeshttps://doi.org/10.53846/goediss-6852openalex-snapshot
Solution Methods for Multi-Objective Robust Combinatorial Optimization
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.