Geometry of optimal value functions with applications to redundancy in linear programming

DOI10.1007/BF02190312zbMath0811.90064MaRDI QIDQ1331104

José H. Dulá

Publication date: 12 September 1994

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

zbMATH Keywords

data envelopment analysis; optimal value function; computational geometry; convex hull problem; frames of polyhedral cones; redundancy in linear programming

Mathematics Subject Classification ID

52B12: Special polytopes (linear programming, centrally symmetric, etc.)

90C05: Linear programming

Related Items

On characterizing the production possibility set for the CCR ratio model in DEA, A new procedure for identifying the frame of the convex hull of a finite collection of points in multidimensional space, Equivalences between data envelopment analysis and the theory of redundancy in linear systems, Excess information in parametric linear optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Redundancy in mathematical programming. A state-of-the-art survey
• Finding duplicate rows in a linear programming model
• New iterative methods for linear inequalities
• Hit-and-run algorithms for the identification of nonredundant linear inequalities
• A Whirlwind Tour of Computational Geometry
• Preprocessing in Stochastic Programming: The Case of Linear Programs
• On Robust Procedures
• Algorithms for frames and lineality spaces of cones
• Convex Analysis
• Stochastic Programs with Recourse