On the public citation graph
The structure of admissible points with respect to cone dominance
0 signed · 168 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/nav.3800030110openalex-snapshot
The optimization of a quadratic function subject to linear constraints
inferredcites →https://doi.org/10.1007/978-3-642-46216-0openalex-snapshot
Convexity and Optimization in Finite Dimensions I
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/bf01580111openalex-snapshot
A revised simplex method for linear multiple objective programs
inferredcites →https://doi.org/10.1007/bf01580453openalex-snapshot
Finding efficient points 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)90128-8openalex-snapshot
Stability in multicriteria optimization
inferredcites →https://doi.org/10.1016/0166-218x(79)90021-0openalex-snapshot
Multiple criteria decision making
inferredcites →https://doi.org/10.1016/0304-4068(74)90002-0openalex-snapshot
Global analysis and economics III
inferredcites →https://doi.org/10.1016/0304-4068(74)90013-5openalex-snapshot
Global analysis and economics V
inferredcites →https://doi.org/10.1016/0304-4068(75)90029-4openalex-snapshot
Characterization of optima in smooth Pareto economic systems
inferredcites →https://doi.org/10.1016/0304-4068(76)90002-1openalex-snapshot
Global analysis and economics VI
inferredcites →https://doi.org/10.1016/0304-4068(76)90023-9openalex-snapshot
Thresholds in pareto sets
inferredcites →https://doi.org/10.1016/0377-2217(77)90063-7openalex-snapshot
A general method for determining the set of all efficient solutions to a linear vectormaximum problem
inferredcites →https://doi.org/10.1017/9781139547390.012openalex-snapshot
General Competitive Equilibrium
inferredcites →https://doi.org/10.1093/comjnl/12.3.207-aopenalex-snapshot
Nonlinear Programming--Sequential Unconstrained Minimization Techniques
inferredcites →https://doi.org/10.1137/0130053openalex-snapshot
First Order Conditions for General Nonlinear Optimization
inferredcites →https://doi.org/10.1137/0315004openalex-snapshot
Proper Efficient Points for Maximizations with Respect to Cones
inferredcites →https://doi.org/10.1287/mnsc.13.3.244openalex-snapshot
Strictly Concave Parametric Programming, Part I: Basic Theory
inferredcites →https://doi.org/10.1287/mnsc.19.4.357openalex-snapshot
An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department
inferredcites →https://doi.org/10.1287/mnsc.4.1.38openalex-snapshot
Management Models and Industrial Applications of Linear Programming
inferredcites →https://doi.org/10.1287/opre.15.1.39openalex-snapshot
Solving Bicriterion Mathematical Programs
inferredcites →https://doi.org/10.1287/opre.22.1.151openalex-snapshot
Generation of the Admissible Boundary of a Convex Polytope
inferredcites →https://doi.org/10.1515/9781400881970-006openalex-snapshot
5. Admissible Points of Convex Sets
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/1235177openalex-snapshot
Three Essays on the State of Economic Science
inferredcites →https://doi.org/10.2307/2226909openalex-snapshot
Activity Analysis of Production and Allocation.
inferredcites →https://doi.org/10.2307/2282415openalex-snapshot
Portfolio Selection: Efficient Diversification of Investments.
inferredcites →https://doi.org/10.2307/2325714openalex-snapshot
Decision Analysis: Introductory Lectures on Choices Under Uncertainty.
inferredcites →https://doi.org/10.2307/2326204openalex-snapshot
Portfolio Selection: Efficient Diversification of Investments.
inferredcites →https://doi.org/10.2307/2345300openalex-snapshot
Decisions with Multiple Objectives: Preferences and Value Tradeoffs.
inferredcites →https://doi.org/10.2307/2553559openalex-snapshot
Introduction to Equilibrium Analysis.
inferredcites →https://doi.org/10.2307/2556234openalex-snapshot
A New Proof of a Theorem in Utility Theory
inferredcites →https://doi.org/10.2307/2584151openalex-snapshot
Decisions with Multiple Objectives: Preferences and Value Tradeoffs.
inferredcites →https://doi.org/10.2307/3006625openalex-snapshot
Portfolio Selection: Efficient Diversification of Investments
inferredcites →https://doi.org/10.2307/3438846openalex-snapshot
Three Essays on the State of Economic Science
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(199609)5:3<232::aid-mcda103>3.0.co;2-7openalex-snapshot
On the Structure of the Non-dominated Set for Bicriteria Programmes
inferred← citeshttps://doi.org/10.1002/(sici)1520-6750(199702)44:1<47::aid-nav3>3.0.co;2-mopenalex-snapshot
Towards finding global representations of the efficient set in multiple objective mathematical programming
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0810openalex-snapshot
Nonlinear Multiobjective Programming
inferred← citeshttps://doi.org/10.1002/mcda.287openalex-snapshot
Piecewise quadratic approximation of the non‐dominated set for bi‐criteria programs
inferred← citeshttps://doi.org/10.1006/jmaa.1998.6218openalex-snapshot
Some More Density Results for Proper Efficiencies
inferred← citeshttps://doi.org/10.1006/jmaa.2000.6814openalex-snapshot
Arcwise Connectedness of Closed Efficient Point Sets
inferred← citeshttps://doi.org/10.1006/jmaa.2001.7680openalex-snapshot
On the Contractibility and Connectedness of an Efficient Point Set
inferred← citeshttps://doi.org/10.1007/0-306-48107-3_1openalex-snapshot
Theory of Vector Optimization
inferred← citeshttps://doi.org/10.1007/0-306-48107-3_2openalex-snapshot
Nonlinear Multiobjective Programming
inferred← citeshttps://doi.org/10.1007/978-1-4419-0437-9_8openalex-snapshot
Smooth Representations of Optimal Solution Sets of Piecewise Linear Parametric Multiobjective Programs
inferred← citeshttps://doi.org/10.1007/978-1-4613-3341-8_20openalex-snapshot
Quasiconcavity of Sets and Connectedness of the Efficient Frontier in Ordered Vector Spaces
inferred← citeshttps://doi.org/10.1007/978-1-4613-3341-8_23openalex-snapshot
Generalized Concavity in Multiobjective Programming
inferred← citeshttps://doi.org/10.1007/978-3-0348-8625-3_27openalex-snapshot
Scalar Minimax Properties in Vectorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-41221-9_2openalex-snapshot
Computing Skyline Incrementally in Response to Online Preference Modification
inferred← citeshttps://doi.org/10.1007/978-3-642-45527-8_12openalex-snapshot
A Generalized Method of Approximating the Set of Efficient Points with Respect to a Convex Cone
inferred← citeshttps://doi.org/10.1007/978-3-642-46473-7_9openalex-snapshot
On Efficient Sets in Vector Maximum Problems — A Brief Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-46631-1_7openalex-snapshot
Multi-Ratio Fractional Programing — A Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-46709-7_12openalex-snapshot
Linear Fractional and Bicriteria Linear Fractional Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-46709-7_17openalex-snapshot
An Approach to Lagrangian Duality in Vector Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-48782-8_2openalex-snapshot
Duality Based Characterizations of Efficient Facets
inferred← citeshttps://doi.org/10.1007/978-3-642-54265-7_9openalex-snapshot
Existence Results for Minimal Points
inferred← citeshttps://doi.org/10.1007/978-3-642-57014-8_9openalex-snapshot
Arrow-Barankin-Blackwell Theorems and Related Results in Cone Duality: A Survey
inferred← citeshttps://doi.org/10.1007/bf00933511openalex-snapshot
Some minimax theorems in vector-valued functions
inferred← citeshttps://doi.org/10.1007/bf00933830openalex-snapshot
Bicriteria linear fractional programming
inferred← citeshttps://doi.org/10.1007/bf00933835openalex-snapshot
Some results about nondominated solutions
inferred← citeshttps://doi.org/10.1007/bf00933970openalex-snapshot
Quasiconcave vector maximization: Connectedness of the sets of Pareto-optimal and weak Pareto-optimal alternatives
inferred← citeshttps://doi.org/10.1007/bf00934353openalex-snapshot
Proper efficiency with respect to 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/bf00934609openalex-snapshot
On a domination property for vector maximization with respect to cones
inferred← citeshttps://doi.org/10.1007/bf00934630openalex-snapshot
Optimality conditions in nonconical multiple-objective programming
inferred← citeshttps://doi.org/10.1007/bf00934641openalex-snapshot
On information functions and their polars
inferred← citeshttps://doi.org/10.1007/bf00934893openalex-snapshot
Maximal points with respect to cone dominance in Banach spaces and their existence
inferred← citeshttps://doi.org/10.1007/bf00934908openalex-snapshot
Duality for nonlinear multiple-criteria optimization problems
inferred← citeshttps://doi.org/10.1007/bf00935343openalex-snapshot
Admissible points of a convex polyhedron
inferred← citeshttps://doi.org/10.1007/bf00939390openalex-snapshot
Weighting factor results in vector optimization
inferred← citeshttps://doi.org/10.1007/bf00939578openalex-snapshot
Lagrange multipliers and generalized differentiable functions in vector extremum problems
inferred← citeshttps://doi.org/10.1007/bf00940478openalex-snapshot
Nonconvex separation theorems and some applications in vector optimization
inferred← citeshttps://doi.org/10.1007/bf00940768openalex-snapshot
On the reciprocal vector optimization problems
inferred← citeshttps://doi.org/10.1007/bf00941178openalex-snapshot
Continuous dependence of solutions on a parameter in a scalarization method
inferred← citeshttps://doi.org/10.1007/bf00941890openalex-snapshot
General form of the Arrow-Barankin-Blackwell theorem in normed spaces and thel ?-case
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/bf01102345openalex-snapshot
On the connectedness of the set of weakly efficient points of a vector optimization problem in locally convex spaces
inferred← citeshttps://doi.org/10.1007/bf01415907openalex-snapshot
Approximation of the efficient point set by perturbation of the ordering cone
inferred← citeshttps://doi.org/10.1007/bf01447324openalex-snapshot
An interactive algorithm for nonlinear vector optimization
inferred← citeshttps://doi.org/10.1007/bf01580853openalex-snapshot
On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
inferred← citeshttps://doi.org/10.1007/bf01583782openalex-snapshot
Existence and characterization of efficient decisions with respect to cones
inferred← citeshttps://doi.org/10.1007/bf01585738openalex-snapshot
Value functions, domination cones and proper efficiency in multicriteria optimization
inferred← citeshttps://doi.org/10.1007/bf02191737openalex-snapshot
Generalized Arrow-Barankin-Blackwell theorems in locally convex spaces
inferred← citeshttps://doi.org/10.1007/bf02191763openalex-snapshot
Connectedness of efficient solution sets for set-valued maps in normed spaces
inferred← citeshttps://doi.org/10.1007/bf02191991openalex-snapshot
The Arrow-Barankin-Blackwell theorem in a dual space setting
inferred← citeshttps://doi.org/10.1007/bf02192023openalex-snapshot
Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
inferred← citeshttps://doi.org/10.1007/bf02192161openalex-snapshot
Density of the set of positive proper minimal points in the set of minimal points
inferred← citeshttps://doi.org/10.1007/bf02612714openalex-snapshot
The range of the efficient frontier in multiple objective linear programming
inferred← citeshttps://doi.org/10.1007/bf02662873openalex-snapshot
Stability of majorly efficient points and solutions in multiobjective programming
inferred← citeshttps://doi.org/10.1007/bf02764874openalex-snapshot
On existence of cone-maximal points in real topological linear spaces
inferred← citeshttps://doi.org/10.1007/bf02888789openalex-snapshot
Soluciones propias en la teoria de la dominacion
inferred← citeshttps://doi.org/10.1007/bfb0076702openalex-snapshot
Non-linear separation theorems, duality and optimality conditions
inferred← citeshttps://doi.org/10.1007/pl00020915openalex-snapshot
Connectedness of super efficient sets in vector optimization of set-valued maps
inferred← citeshttps://doi.org/10.1007/s10255-006-0352-1openalex-snapshot
On Connectedness of Efficient Solution Sets for a Star Cone-Quasiconvex Vector Optimization Problem
inferred← citeshttps://doi.org/10.1007/s10589-011-9403-5openalex-snapshot
Generating equidistant representations in biobjective programming
inferred← citeshttps://doi.org/10.1007/s10957-007-9171-7openalex-snapshot
Some Geometrical Aspects of Efficient Points in Vector Optimization
inferred← citeshttps://doi.org/10.1007/s11228-009-0120-5openalex-snapshot
Pareto Solutions of Polyhedral-valued Vector Optimization Problems in Banach Spaces
inferred← citeshttps://doi.org/10.1007/s11425-008-0021-3openalex-snapshot
The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces
inferred← citeshttps://doi.org/10.1016/0022-247x(84)90269-5openalex-snapshot
Optimization over the efficient set
inferred← citeshttps://doi.org/10.1016/0022-247x(85)90225-2openalex-snapshot
Images of connected sets by semicontinuous multifunctions
inferred← citeshttps://doi.org/10.1016/0022-247x(86)90061-2openalex-snapshot
The domination property in multicriteria optimization
inferred← citeshttps://doi.org/10.1016/0022-247x(89)90356-9openalex-snapshot
Parametrized multicriteria optimization; Order continuity of the marginal multifunctions
inferred← citeshttps://doi.org/10.1016/0022-247x(91)90265-2openalex-snapshot
A generalization of the Arrow-Barankin-Blackwell theorem in normed spaces
inferred← citeshttps://doi.org/10.1016/0362-546x(90)90057-nopenalex-snapshot
Contractibility of efficient point sets in normed spaces
inferred← citeshttps://doi.org/10.1016/0377-2217(83)90081-4openalex-snapshot
Concepts of proper efficiency
inferred← citeshttps://doi.org/10.1016/0377-2217(85)90314-5openalex-snapshot
Decision making under uncertainty: A semi-infinite programming approach
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.1023/a:1004605810296openalex-snapshot
Outcome Space Partition of the Weight Set in Multiobjective Linear Programming
inferred← citeshttps://doi.org/10.1023/a:1004649928081openalex-snapshot
Contractibility and Connectedness of Efficient Point Sets
inferred← citeshttps://doi.org/10.1023/a:1004670229860openalex-snapshot
Comparison of Existence Results for Efficient Points
inferred← citeshttps://doi.org/10.1023/a:1008285515867openalex-snapshot
Global Optimization in Practice: An Application to Interactive Multiple Objective Linear Programming
inferred← citeshttps://doi.org/10.1023/a:1011267305444openalex-snapshot
Norm-Based Approximation in Bicriteria Programming
inferred← citeshttps://doi.org/10.1023/a:1017531600410openalex-snapshot
Existence and Density Results for Proper Efficiency in Cone Compact Sets
inferred← citeshttps://doi.org/10.1023/a:1017599614183openalex-snapshot
Efficient Sets of Convex Compacta are Arcwise Connected
inferred← citeshttps://doi.org/10.1023/a:1022615217553openalex-snapshot
Characterizations of the Nonemptiness and Compactness of Solution Sets in Convex Vector Optimization
inferred← citeshttps://doi.org/10.1023/a:1022616612527openalex-snapshot
Connectedness of the Efficient Set for Strictly Quasiconcave Sets
inferred← citeshttps://doi.org/10.1023/a:1022627520279openalex-snapshot
On Efficient Solutions in Vector Optimization
inferred← citeshttps://doi.org/10.1023/a:1022631621188openalex-snapshot
Generalizations of a Theorem of Arrow, Barankin, and Blackwell in Topological Vector Spaces
inferred← citeshttps://doi.org/10.1023/a:1022647831434openalex-snapshot
Generalization of the Arrow–Barankin–Blackwell Theorem in a Dual Space Setting
inferred← citeshttps://doi.org/10.1023/a:1023021604751openalex-snapshot
Maximal Points of Convex Sets in Locally Convex Topological Vector Spaces: Generalization of the Arrow–Barankin–Blackwell Theorem
inferred← citeshttps://doi.org/10.1023/a:1026412918497openalex-snapshot
Connectedness of Cone Superefficient Point Sets in Locally Convex Topological Vector Spaces
inferred← citeshttps://doi.org/10.1023/b:jota.0000005043.39887.76openalex-snapshot
On the Density of Positive Proper Efficient Points in a Normed Space
inferred← citeshttps://doi.org/10.1051/m2an/1987210406051openalex-snapshot
Meilleure approximation en norme vectorielle et théorie de la localisation
inferred← citeshttps://doi.org/10.1080/01630568508816205openalex-snapshot
Pareto efficiency in locally convex spaces i
inferred← citeshttps://doi.org/10.1080/02331930500096270openalex-snapshot
Connectedness of efficient points in convex and convex transformable vector optimization
inferred← citeshttps://doi.org/10.1080/02331934.2015.1132217openalex-snapshot
A generalization of a theorem of Arrow, Barankin and Blackwell to a nonconvex case
inferred← citeshttps://doi.org/10.1080/02331938008842650openalex-snapshot
The geometry of Pareto efficiency over cones
inferred← citeshttps://doi.org/10.1080/02331938208842824openalex-snapshot
Bibliographic zur Vektoroptimierung -Theorie und Anwendungen (1. Fortsetzung)
inferred← citeshttps://doi.org/10.1080/02331938408842951openalex-snapshot
On the connectedness of the set of efficient points n convex optimization problems with multiple or random Objectives
inferred← citeshttps://doi.org/10.1080/02331938608843153openalex-snapshot
Input optimization: III. optimal realizations of multiobjective models
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/02331938908843499openalex-snapshot
Some results on regularity in vector optimization
inferred← citeshttps://doi.org/10.1080/02331938908843501openalex-snapshot
Approximating families of cones and proper efficiency in vector optimization
inferred← citeshttps://doi.org/10.1080/02331939408843922openalex-snapshot
On the existence of efficient points
inferred← citeshttps://doi.org/10.1080/02331939708844267openalex-snapshot
Connectivity of efficient solution sets in vector optimization of set-valued mappings
inferred← citeshttps://doi.org/10.1080/02331939908844461openalex-snapshot
A New Abb Theorem In Banach Spaces
inferred← citeshttps://doi.org/10.1080/02522667.1989.10698955openalex-snapshot
Stationary Points and Necessary Conditions in Vector Extremum Problems
inferred← citeshttps://doi.org/10.1080/02522667.1989.10698957openalex-snapshot
Some Optimality Conditions in Vector Optimization
inferred← citeshttps://doi.org/10.1090/s0002-9939-96-03162-0openalex-snapshot
On the density of proper efficient points
inferred← citeshttps://doi.org/10.1109/cdc.1989.70622openalex-snapshot
Positive proper efficient points in vector optimization
inferred← citeshttps://doi.org/10.1137/0326055openalex-snapshot
A Generalization of a Theorem of Arrow, Barankin, and Blackwell
inferred← citeshttps://doi.org/10.1137/0328021openalex-snapshot
On a Theorem of Arrow, Barankin, and Blackwell
inferred← citeshttps://doi.org/10.1137/0331015openalex-snapshot
Two Generalizations of a Theorem of Arrow, Barankin, and Blackwell
inferred← citeshttps://doi.org/10.1142/9789812778215_0010openalex-snapshot
On Pareto Efficiency: A General Constructive Existence Principle
inferred← citeshttps://doi.org/10.1214/105051606000000880openalex-snapshot
On the density of properly maximal claims in financial markets with transaction costs
inferred← citeshttps://doi.org/10.1287/mnsc.26.7.694openalex-snapshot
Linear Multiple Objective Problems with Interval Coefficients
inferred← citeshttps://doi.org/10.1287/mnsc.29.2.250openalex-snapshot
Connectedness in Multiple Linear Fractional Programming
inferred← citeshttps://doi.org/10.1287/mnsc.31.4.461openalex-snapshot
Multiple Objective Linear Programming with Parametric Criteria Coefficients
inferred← citeshttps://doi.org/10.1287/opre.50.4.670.2857openalex-snapshot
A Bi-Objective Median Location Problem With a Line Barrier
inferred← citeshttps://doi.org/10.1360/za2008-38-3-315openalex-snapshot
赋范空间中逐段线性多目标优化问题弱Pareto 解集的结构
inferred← citeshttps://doi.org/10.21236/ada052777openalex-snapshot
Basic Studies in Combinatorial and Nondifferentiable Optimization.
inferred← citeshttps://doi.org/10.3982/ecta18930openalex-snapshot
“Near” Weighted Utilitarian Characterizations of Pareto Optima
inferred← citeshttps://doi.org/10.4064/am-25-1-121-127openalex-snapshot
On the connectivity of efficient point sets
inferred← citeshttps://doi.org/10.4236/am.2012.330199openalex-snapshot
An Application of the Maximum Theorem in Multi-Criteria Optimization, Properties of Pareto-Retract Mappings, and the Structure of Pareto Sets
inferred← citeshttps://doi.org/10.48550/arxiv.1705.11124openalex-snapshot
Proper efficiency and cone efficiency
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.