Polyhedral Cones and Feasibility of Polyhedra
摘要
We deal here with convex cones and polyhedra in finite dimension. A technique specific for finite dimension is the dual conical feasibility and optimality algorithm.