| Article ID: | iaor20111978 |
| Volume: | 148 |
| Issue: | 3 |
| Start Page Number: | 550 |
| End Page Number: | 570 |
| Publication Date: | Mar 2011 |
| Journal: | Journal of Optimization Theory and Applications |
| Authors: | Gabidullina R |
| Keywords: | optimization |
We propose a new approach to the strict separation of convex polyhedra. This approach is based on the construction of the set of normal vectors for the hyperplanes, such that each one strict separates the polyhedra A and B. We prove the necessary and sufficient conditions of strict separability for convex polyhedra in the Euclidean space and present its applications in optimization.