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

DOI10.1007/BF02190312zbMath0811.90064OpenAlexW2028444825MaRDI QIDQ1331104

José H. Dulá

Publication date: 12 September 1994

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

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

zbMATH Keywords

data envelopment analysisoptimal value functioncomputational geometryconvex hull problemframes of polyhedral conesredundancy in linear programming

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Linear programming (90C05)

Related Items (6)

Competing output-sensitive frame algorithms ⋮ On characterizing the production possibility set for the CCR ratio model in DEA ⋮ An algorithm to find the lineality space of the positive hull of a set of vectors ⋮ 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

This page was built for publication: Geometry of optimal value functions with applications to redundancy in linear programming