Milan Hladík. Explicit description of all separating hyperplanes of two convex polyhedral sets with RHS-parameters. In WDS 2004 - Proceedings of Contributed Papers, Part~I, June 15-18, Matfyzpress, Prague, pp. 63–70, 2004.
Separation theorem is a basic theorem of convex analysis and convex programming. Its applicability to nonlinear programming methods depends on whether we can describe a separating hyperplane of two or more convex sets. But often in practice data are not fixed and we have to deal with parameters. A calculation of all separating hyperplanes of two convex polyhedral sets, which depend on right-hand-side parameters, is dealt with in this article.
@InProceedings{Hla2004,
author = "Milan Hlad\'{\i}k",
editor = {Jana \v{S}afr\'ankov\'a},
title = "Explicit description of all separating hyperplanes of two convex polyhedral sets with {RHS}-parameters",
booktitle = {WDS 2004 - Proceedings of Contributed Papers, Part~I, June 15-18, Matfyzpress, Prague},
pages = "63-70",
year = "2004",
bib2html_dl_ps = "https://kam.mff.cuni.cz/~hladik/doc/ref_wds.ps",
abstract = "Separation theorem is a basic theorem of convex analysis and convex programming. Its applicability to nonlinear programming methods depends on whether we can describe a separating hyperplane of two or more convex sets. But often in practice data are not fixed and we have to deal with parameters. A calculation of all separating hyperplanes of two convex polyhedral sets, which depend on right-hand-side parameters, is dealt with in this article.",
keywords = "separation, separating hyperplane, convex polyhedra, parameters",
}
Generated by bib2html.pl (written by Patrick Riley ) on Mon Apr 15, 2024 08:26:42