Print Email Facebook Twitter Similarity transformations between minimal presentations of convex polyhedral cones Title Similarity transformations between minimal presentations of convex polyhedral cones Author ten Dam, A.A. Institution National Aerospace Laboratory NLR Date 1993-05-04 Abstract A system of linear homogeneous inequalities determines a convex polyhedral cone of feasible solutions. It is investigated under which conditions polyhedral cones can be represented also by a system that contains equalities as well as inequalities. Different representations of the same convex polyhedral cone are related by elementary transformations. It is investigated when representations contain the minimum number of equations necessary to describe a convex polyhedral cone. Moreover, such representations are related by so called similarity transformations. The results presented here can contribute to an easier resolution of problems in optimization theory and control theory. Subject polyhedronsconesconvexityinequalitiessimilarity theoremtransformations (mathematics)matrices (mathematics)optimizationrepresentationsset theory To reference this document use: http://resolver.tudelft.nl/uuid:73d07491-d2b7-415a-8713-18f5eecfc25b Publisher Nationaal Lucht- en Ruimtevaartlaboratorium Access restriction Campus only Source NLR Technical Publication TP 93193 U Part of collection Aerospace Engineering Reports Document type report Rights (c) 1993 National Aerospace Laboratory NLR Files PDF 93193.pdf 17.79 MB Close viewer /islandora/object/uuid:73d07491-d2b7-415a-8713-18f5eecfc25b/datastream/OBJ/view