Two Proofs of a Structural Theorem of Decreasing Minimization on Integrally Convex Sets
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913807192817664 |
|---|---|
| author | Murota, Kazuo Tamura, Akihisa |
| author_facet | Murota, Kazuo Tamura, Akihisa |
| contents | This paper gives two different proofs to a structural theorem of decreasing minimization (lexicographic optimization) on integrally convex sets. The theorem states that the set of decreasingly minimal elements of an integrally convex set can be represented as the intersection of a unit discrete cube and a face of the convex hull of the given integrally convex set. The first proof resorts to the Fenchel-type duality theorem in discrete convex analysis and the second is more elementary using Farkas' lemma. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_06463 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Two Proofs of a Structural Theorem of Decreasing Minimization on Integrally Convex Sets Murota, Kazuo Tamura, Akihisa Optimization and Control Combinatorics 52A41, 90C27, 90C25 This paper gives two different proofs to a structural theorem of decreasing minimization (lexicographic optimization) on integrally convex sets. The theorem states that the set of decreasingly minimal elements of an integrally convex set can be represented as the intersection of a unit discrete cube and a face of the convex hull of the given integrally convex set. The first proof resorts to the Fenchel-type duality theorem in discrete convex analysis and the second is more elementary using Farkas' lemma. |
| title | Two Proofs of a Structural Theorem of Decreasing Minimization on Integrally Convex Sets |
| topic | Optimization and Control Combinatorics 52A41, 90C27, 90C25 |
| url | https://arxiv.org/abs/2501.06463 |