The structure of max–min hyperplanes
✍ Scribed by V. Nitica
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 485 KB
- Volume
- 432
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
✦ Synopsis
In this article, continuing [12,13], further contributions to the theory of max-min convex geometry are given. The max-min semiring is the set R = R ∪ {±∞} endowed with the operations ⊕ = max, ⊗ = min in R. A max-min hyperplane (briefly, a hyperplane) is the set of all points x = (x 1 , . . . , x n ) ∈ R n satisfying an equation of the form
, where each side contains at least one term, and where a i / = b i for at least one index i. The main result is a description of a hyperplane in terms of simple polyhedral blocks.
As an application, one shows that the separation of max-min closed convex sets by max-min hyperplanes is not possible in general.
📜 SIMILAR VOLUMES
This paper investigates the complexity of the min-max and min-max regret assignment problems both in the discrete scenario and interval data cases. We show that these problems are strongly NP-hard for an unbounded number of scenarios. We also show that the interval data min-max regret assignment pro
A close analysis of the Syllogism inference rule shows that if one uses Zadeh's notion of fuzzy if-then, then the proper way of combining the membership values of two fuzzy rules rl: "if A, then B" and r2: "if B, then C" is not by the usual max-min composition rule, but by the following min-max rule