Algorithms for frames and lineality spaces of cones

DOI10.6028/jres.071B.001zbMath0157.49502OpenAlexW2003923263MaRDI QIDQ5540113

Roger J.-B. Wets, Christoph Witzgall

Publication date: 1967

Published in: Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.6028/jres.071b.001

zbMATH Keywords

operations research

Related Items

Geometry of optimal value functions with applications to redundancy in linear programming, On minimal positive basis for polyhedral cones in Rn, Designing a majorization scheme for the recourse function in two-stage stochastic linear programming, SOLVING A SPECIAL CLASS OF MULTIPLE OBJECTIVE LINEAR FRACTIONAL PROGRAMMING PROBLEMS, Efficiency evaluation of very large-scale samples: data envelopment analysis with angle-index synthesis, Nota sobre programacion lineal estocastica: Evolucion y estado actual. (I), Unnamed Item, An algorithm to find the lineality space of the positive hull of a set of vectors, The complexity of linear programming, ORDMET: a general algorithm for constructing all numerical solutions to ordered metric structures, Redundant objective functions in linear vector maximum problems and their determination, Towards an algebraic characterization of convex polyhedral cones, Solving multiple objective linear programs in objective space, A new procedure for identifying the frame of the convex hull of a finite collection of points in multidimensional space, Least distance methods for the scheme of polytopes, On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program