Algorithms for frames and lineality spaces of cones
From MaRDI portal
Cited in
(17)- ORDMET: a general algorithm for constructing all numerical solutions to ordered metric structures
- Redundant objective functions in linear vector maximum problems and their determination
- A new procedure for identifying the frame of the convex hull of a finite collection of points in multidimensional space
- On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program
- Geometry of optimal value functions with applications to redundancy in linear programming
- Designing a majorization scheme for the recourse function in two-stage stochastic linear programming
- Towards an algebraic characterization of convex polyhedral cones
- Solving a special class of multiple objective linear fractional programming problems
- Least distance methods for the scheme of polytopes
- Nota sobre programacion lineal estocastica: Evolucion y estado actual. (I)
- On minimal positive basis for polyhedral cones in Rn
- The complexity of linear programming
- Efficiency evaluation of very large-scale samples: data envelopment analysis with angle-index synthesis
- Continuity of the conic hull
- An algorithm to find the lineality space of the positive hull of a set of vectors
- Methods for identifying all extreme points of convex hulls in spaces of dimension greater than 3 revisited
- Solving multiple objective linear programs in objective space
This page was built for publication: Algorithms for frames and lineality spaces of cones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5540113)
