A Theorem on Strict Separability of Convex Polyhedra and Its Applications in Optimization

dc.contributor.author	Gabidullina Z.
dc.date.accessioned	2018-09-18T20:05:26Z
dc.date.available	2018-09-18T20:05:26Z
dc.date.issued	2011
dc.identifier.issn	0022-3239
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/136412
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. © 2010 Springer Science+Business Media, LLC.
dc.relation.ispartofseries	Journal of Optimization Theory and Applications
dc.subject	Distance between the polyhedra
dc.subject	Normal vector
dc.subject	Polyhedron
dc.subject	Separating hyperplane
dc.subject	Supporting hyperplane
dc.subject	Thickness of the separation margin
dc.title	A Theorem on Strict Separability of Convex Polyhedra and Its Applications in Optimization
dc.type	Article
dc.relation.ispartofseries-issue	3
dc.relation.ispartofseries-volume	148
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	550
dc.source.id	SCOPUS00223239-2011-148-3-SID79251625667

Files in this item

Size: 43.68Kb

Format: PDF

Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.