KFU. Card publication. A Theorem on Strict Separability of Convex Polyhedra and Its Applications in Optimization.

KAZAN
FEDERAL UNIVERSITY

- RUS
- 中文
- ES

A THEOREM ON STRICT SEPARABILITY OF CONVEX POLYHEDRA AND ITS APPLICATIONS IN OPTIMIZATION.

Form of presentation

Articles in international journals and collections

Year of publication

2011

��

��

Authors, employees of KFU

Gabidullina Zulfiya Ravilevna, author

Bibliographic description in the original language

Gabidullina Z.R. A Theorem on Strict Separability of Convex Polyhedra and Its Applications in Optimization. Journal of Optimization Theory and Applications, ISSN 0022-3239 (print), Vol.148, N 3, 2011, p.p.550-570, Springer US (Web of Science, Scopus) (Impact factor 2011 1,062)

Annotation

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.

Keywords

Polyhedron, Separating hyperplane, Normal vector, Supporting hyperplane, Thickness of the separation margin, Distance between the polyhedra

The name of the journal

J OPTIMIZ THEORY APP

URL

http://link.springer.com/article/10.1007/s10957-010-9767-1

Please use this ID to quote from or refer to the card

https://repository.kpfu.ru/eng/?p_id=26591&p_lang=2

Full metadata record

Field DC	Value	Language
dc.contributor.author	Gabidullina Zulfiya Ravilevna	ru_RU
dc.date.accessioned	2011-01-01T00:00:00Z	ru_RU
dc.date.available	2011-01-01T00:00:00Z	ru_RU
dc.date.issued	2011	ru_RU
dc.identifier.citation	Gabidullina Z.R. A Theorem on Strict Separability of Convex Polyhedra and Its Applications in Optimization. Journal of Optimization Theory and Applications, ISSN 0022-3239 (print), Vol.148, N 3, 2011, p.p.550-570, Springer US (Web of Science, Scopus) (Impact factor 2011 1,062)	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=26591&p_lang=2	ru_RU
dc.description.abstract	J OPTIMIZ THEORY APP	ru_RU
dc.description.abstract	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.	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	Polyhedron	ru_RU
dc.subject	Separating hyperplane	ru_RU
dc.subject	Normal vector	ru_RU
dc.subject	Supporting hyperplane	ru_RU
dc.subject	Thickness of the separation margin	ru_RU
dc.subject	Distance between the polyhedra	ru_RU
dc.title	A Theorem on Strict Separability of Convex Polyhedra and Its Applications in Optimization.	ru_RU
dc.type	Articles in international journals and collections	ru_RU