On the public citation graph

A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions

https://doi.org/10.1007/bf01099463
0 signed · 79 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-1-4615-3612-3openalex-snapshot
Multiobjective Optimization: Behavioral and Computational Considerations
inferredcites →https://doi.org/10.1007/978-3-642-50280-4openalex-snapshot
Theory of Vector Optimization
inferredcites →https://doi.org/10.1007/978-3-642-87563-2_2openalex-snapshot
An Algorithm for Combined Quadratic and 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/bf00933152openalex-snapshot
Existence of efficient solutions for vector maximization problems
inferredcites →https://doi.org/10.1007/bf00933970openalex-snapshot
Quasiconcave vector maximization: Connectedness of the sets of Pareto-optimal and weak Pareto-optimal alternatives
inferredcites →https://doi.org/10.1007/bf00934115openalex-snapshot
An existence result for maximizations 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/bf00934467openalex-snapshot
On a domination property for vector maximization with respect to cones
inferredcites →https://doi.org/10.1007/bf00934497openalex-snapshot
Stability of nondominated solutions in multicriteria decision-making
inferredcites →https://doi.org/10.1007/bf00934609openalex-snapshot
On a domination property for vector maximization with respect to cones
inferredcites →https://doi.org/10.1007/bf00935493openalex-snapshot
Generating all maximal efficient faces for multiple objective linear programs
inferredcites →https://doi.org/10.1007/bf00936168openalex-snapshot
On the domination property in vector optimization
inferredcites →https://doi.org/10.1007/bf00938627openalex-snapshot
Existence theorems in vector optimization
inferredcites →https://doi.org/10.1007/bf00941298openalex-snapshot
Determination of the efficient set in multiobjective linear programming
inferredcites →https://doi.org/10.1007/bf01098361openalex-snapshot
On the existence of efficient points in locally convex spaces
inferredcites →https://doi.org/10.1007/bf01580453openalex-snapshot
Finding efficient points for linear multiple objective programs
inferredcites →https://doi.org/10.1007/bf01583782openalex-snapshot
Existence and characterization of efficient decisions with respect to cones
inferredcites →https://doi.org/10.1007/bf01593795openalex-snapshot
Testing for complete efficiency in a vector maximization problem
inferredcites →https://doi.org/10.1007/bf02023100openalex-snapshot
On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program
inferredcites →https://doi.org/10.1007/bf02192161openalex-snapshot
Density of the set of positive proper minimal points in the set of minimal points
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/0022-247x(83)90230-5openalex-snapshot
Efficiency and proper efficiency in vector maximization with respect to cones
inferredcites →https://doi.org/10.1016/0022-247x(86)90061-2openalex-snapshot
The domination property in multicriteria optimization
inferredcites →https://doi.org/10.1016/0022-247x(87)90065-5openalex-snapshot
Analysis of the objective space in multiple objective linear programming
inferredcites →https://doi.org/10.1016/0022-247x(87)90264-2openalex-snapshot
Connectedness of the efficient point sets in quasiconcave vector maximization
inferredcites →https://doi.org/10.1016/0024-3795(92)90281-eopenalex-snapshot
A representation of the set of feasible objectives in multiple objective linear programs
inferredcites →https://doi.org/10.1016/0167-6377(91)90026-lopenalex-snapshot
Complete efficiency and the initialization of algorithms for multiple objective programming
inferredcites →https://doi.org/10.1016/0377-2217(90)90010-9openalex-snapshot
Solving multiple objective linear programs in objective space
inferredcites →https://doi.org/10.1016/0377-2217(90)90011-yopenalex-snapshot
Constructing the set of efficient objective values in multiple objective linear programs
inferredcites →https://doi.org/10.1016/0377-2217(93)e0247-uopenalex-snapshot
A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
inferredcites →https://doi.org/10.1016/0377-2217(94)00199-5openalex-snapshot
A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
inferredcites →https://doi.org/10.1016/s0076-5392(08)x6053-9openalex-snapshot
Multiobjective Programming and Planning
inferredcites →https://doi.org/10.1016/s0076-5392(09)x6017-0openalex-snapshot
Theory of Multiobjective Optimization
inferredcites →https://doi.org/10.1016/s0927-0507(89)01011-xopenalex-snapshot
Chapter X Multiple criteria decision making: Five basic concepts
inferredcites →https://doi.org/10.1017/s1446788700028639openalex-snapshot
Lipschitz and differentiable dependence of solutions on a parameter in a scalarization method
inferredcites →https://doi.org/10.1038/sj.jors.2600425openalex-snapshot
Nonlinear Programming
inferredcites →https://doi.org/10.1057/jors.1983.105openalex-snapshot
Multi-Objective Decision Analysis with Engineering and Business Applications
inferredcites →https://doi.org/10.1057/jors.1983.216openalex-snapshot
Multiple Criteria Decision Making
inferredcites →https://doi.org/10.1080/02331939408843922openalex-snapshot
On the existence of efficient points
inferredcites →https://doi.org/10.1111/j.1540-5915.1985.tb01479.xopenalex-snapshot
Concepts, Theory, and Techniques PRINCIPLES OF MULTIOBJECTIVE OPTIMIZATION*
inferredcites →https://doi.org/10.1137/0326055openalex-snapshot
A Generalization of a Theorem of Arrow, Barankin, and Blackwell
inferredcites →https://doi.org/10.1287/mnsc.30.11.1268openalex-snapshot
An Overview of Techniques for Solving Multiobjective Mathematical Programs
inferredcites →https://doi.org/10.1287/moor.8.1.64openalex-snapshot
On the Existence of Pareto Efficient Points
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis
inferredcites →https://doi.org/10.1515/9781400881970-006openalex-snapshot
5. Admissible Points of Convex Sets
inferredcites →https://doi.org/10.1525/9780520411586-036openalex-snapshot
Nonlinear Programming
inferredcites →https://doi.org/10.2307/1907817openalex-snapshot
Contributions to the Theory of Games
inferredcites →https://doi.org/10.2307/2288767openalex-snapshot
Multiple Criteria Decision Making.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-1-4615-6103-3_11openalex-snapshot
Multi-Criteria and Goal Programming
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/s101070050011openalex-snapshot
Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
inferred← citeshttps://doi.org/10.1007/s10898-011-9764-4openalex-snapshot
Criteria and dimension reduction of linear multiple criteria optimization problems
inferred← citeshttps://doi.org/10.1007/s10957-010-9721-2openalex-snapshot
Reverse Convex Programming Approach in the Space of Extreme Criteria for Optimization over Efficient Sets
inferred← citeshttps://doi.org/10.1016/j.ejor.2003.06.029openalex-snapshot
Some geometrical aspects of the efficient line in vector optimization
inferred← citeshttps://doi.org/10.1016/j.ejor.2012.06.022openalex-snapshot
Global maximization of UTA functions in multi-objective optimization
inferred← citeshttps://doi.org/10.1016/j.ejor.2025.06.012openalex-snapshot
Fifty years of multi-objective optimization and decision-making: From mathematical programming to evolutionary computation
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00153-9openalex-snapshot
A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program
inferred← citeshttps://doi.org/10.1016/s0377-2217(98)00230-6openalex-snapshot
Maximizing a concave function over the efficient or weakly-efficient set
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:1004657827134openalex-snapshot
Branch-and-Bound Variant of an Outcome-Based Algorithm for Optimizing over the Efficient Set of a Bicriteria Linear Programming Problem
inferred← citeshttps://doi.org/10.1023/a:1008215702611openalex-snapshot
An Outer Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple Objective Linear Programming Problem
inferred← citeshttps://doi.org/10.1023/a:1008228830480openalex-snapshot
Epsilon Dominance and Constraint Partitioning in Multiple Objective Problems
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:1008364005245openalex-snapshot
inferred← citeshttps://doi.org/10.1023/a:1013875600711openalex-snapshot
Optimization over the efficient set: overview
inferred← citeshttps://doi.org/10.1023/a:1022523615101openalex-snapshot
Minimum Maximal Flow Problem: An Optimization over the Efficient Set
inferred← citeshttps://doi.org/10.1023/a:1022614814789openalex-snapshot
Further Analysis of an Outcome Set-Based Algorithm for Multiple-Objective Linear Programming
inferred← citeshttps://doi.org/10.1023/a:1022628612489openalex-snapshot
Hybrid Approach for Solving Multiple-Objective Linear Programs in Outcome Space
inferred← citeshttps://doi.org/10.1023/a:1022659523991openalex-snapshot
Utility Function Programs and Optimization over the Efficient Set in Multiple-Objective Decision Making
inferred← citeshttps://doi.org/10.1023/a:1026544116333openalex-snapshot
Conical Algorithm in Global Optimization for Optimizing over Efficient Sets
inferred← citeshttps://doi.org/10.1080/02331934.2018.1484922openalex-snapshot
Primal and dual algorithms for optimization over the efficient set
inferred← citeshttps://doi.org/10.1109/5326.827456openalex-snapshot
Probability density function estimation using the MinMax measure
inferred← citeshttps://doi.org/10.1155/2008/231845openalex-snapshot
Some Characterizations of Ideal Points in Vector Optimization Problems
inferred← citeshttps://doi.org/10.1287/opre.1080.0581openalex-snapshot
Generating a Representative Subset of the Nondominated Frontier in Multiple Criteria Decision Making
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.