Minimal Committee Problem for Inconsistent Systems of Linear Inequalities on the Plane

dc.creatorKobylkin, K. S.
dc.date2008-02-11
dc.date2008-02-15
dc.date.accessioned2026-07-07T09:20:42Z
dc.date.available2026-07-07T09:20:42Z
dc.descriptionA representation of an arbitrary system of strict linear inequalities in R^n as a system of points is proposed. The representation is obtained by using a so-called polarity. Based on this representation an algorithm for constructing a committee solution of an inconsistent plane system of linear inequalities is given. A solution of two problems on minimal committee of a plane system is proposed. The obtained solutions to these problems can be found by means of the proposed algorithm.
dc.description29 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/0802.1514
dc.identifierhttp://arxiv.org/abs/0802.1514
dc.identifierdoi:10.1134/S1054661806040201
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/154804
dc.subjectDiscrete Mathematics
dc.subjectComputational Geometry
dc.titleMinimal Committee Problem for Inconsistent Systems of Linear Inequalities on the Plane
dc.typetext

Files

Collections