A method for constructing the polar cone of a polyhedral cone, with applications to linear multicriteria decision problems

DOI10.1007/BF00934654zbMath0309.90029OpenAlexW2018787597MaRDI QIDQ1219202

S. Singh

Publication date: 1976

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00934654

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (4)

On proper and improper efficient solutions of optimal problems with multicriteria ⋮ Necessary and sufficient conditions for local and global nondominated solutions in decision problems with multi-objectives ⋮ The utility efficient set and its interactive reduction ⋮ On efficient sets in vector maximum problems - A brief survey

Cites Work

• Unnamed Item
• Unnamed Item
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Constrained minimization under vector-valued criteria in finite dimensional spaces
• Control space properties of cooperative games
• A note on control space properties of cooperative games
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• ON LINEAR VECTOR MAXIMIZATION PROBLEMS
• Algorithms for the vector maximization problem
• Necessary and sufficient conditions for differentiable nonscalar-valued functions to attain extrema
• Cooperative games and vector-valued criteria problems
• On Pareto optimal decisions for a coalition of a subset of players
• On noninferior performance index vectors

This page was built for publication: A method for constructing the polar cone of a polyhedral cone, with applications to linear multicriteria decision problems