ISSN:
1573-2878
Keywords:
Linear programming
;
optimal value functions
;
redundancy in linear programming
;
convex hull problem
;
data envelopment analysis
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract In 1967, Wets and Witzgall (Ref. 1) made, in passing, a connection between frames of polyhedral cones and redundancy in linear programming. The present work elaborates and formalizes the theoretical details needed to establish this relation. We study the properties of optimal value functions in order to derive the correspondence between problems in redundancy and the frame of a polyhedral cone. The insights obtained lead to schemes to improve the efficiency of procedures to detect redundancy in the areas of linear programming, stochastic programming, and computational geometry.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02190312
