DETERMINATION OF EDGES OF A CONVEX POLYTOPE
Öz
In this paper, the problem of determination of the edges of a convex polytope is considered. It is shown that this problem is equivalent to the standard linear programming problem and therefore can be solved by the simplex method. Further, for a special type of polytopes which are an affine transformation of a box we show that extremal points determine edges
Anahtar Kelimeler
Kaynakça
- Barmish, B.R. (1994). New Tools for Robustness of Linear Systems, MacMillan, New York.
- Bartlett, A.C., Hollot, C.V. and Huang, L. (1988). Root locations of an entire polytope of polynomials: It suffices to check the edges, Mathematics of Control, Signals and Systems 1, 61-71.
- Bhattacharyya, S.P., Chapellat, H. and Keel, L.H. (1995). Robust Control: The Parametric Approach , Prentice Hall, New Jersey.
- Dullá, J.H., Helgason, R.V. and Hickman, B.L. (1992). Preprocessing schemes and a solution method for the convex hull problem in multidimensional space, in: O. Balci (ed.), Computer Science and Operations Research: New Developments in their Interfaces, Pergamon, Oxford.
- Dullá, J.H. and Helgason, R.V. (1996). A new procedure for identifying the frame of the convex hull of a finite collection of points in multidimensional space, European Journal of Operational Re- search 92, 352-367.
- Fukuda, K. (2004). From the zonotope construction to the Minkowski addition of convex polytopes, Journal of Symbolic Computation 38, No. 4, 1261-1272.
- Grünbaum, B. (2003). Convex Polytopes, Springer, New York.
- Murty, K.G. (2009). A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes, Optim. Lett., 3, No. 2, 211-237.
- Papadimitriou, C.H. and Steiglitz, K. (1998). Combinatorial Optimization: Algorithms and Complexi- ty, Dover, New York.
- Pujara, L.R. and Bollepalli, B.S. (1994). On the geometry and stability of a polytope generated by a finite set of polynomials, American Control Conference, Baltimore, 236-237.