ダウンロード数: 207
このアイテムのファイル:
ファイル | 記述 | サイズ | フォーマット | |
---|---|---|---|---|
ro_2019001.pdf | 227.65 kB | Adobe PDF | 見る/開く |
タイトル: | Greedy systems of linear inequalities and lexicographically optimal solutions |
著者: | Fujishige, Satoru |
著者名の別形: | 藤重, 悟 |
キーワード: | Greedy system lexicographic optimality discrete convexity integrally convex functions |
発行日: | Nov-2019 |
出版者: | EDP Sciences |
誌名: | RAIRO - Operations Research |
巻: | 53 |
号: | 5 |
開始ページ: | 1929 |
終了ページ: | 1935 |
抄録: | The present note reveals the role of the concept of greedy system of linear inequalities played in connection with lexicographically optimal solutions on convex polyhedra and discrete convexity. The lexicographically optimal solutions on convex polyhedra represented by a greedy system of linear inequalities can be obtained by a greedy procedure, a special form of which is the greedy algorithm of J. Edmonds for polymatroids. We also examine when the lexicographically optimal solutions become integral. By means of the Fourier–Motzkin elimination Murota and Tamura have recently shown the existence of integral points in a polyhedron arising as a subdifferential of an integer-valued, integrally convex function due to Favati and Tardella [Murota and Tamura, Integrality of subgradients and biconjugates of integrally convex functions. Preprint arXiv:1806.00992v1 (2018)], which can be explained by our present result. A characterization of integrally convex functions is also given. |
著作権等: | © EDP Sciences, ROADEF, SMAI 2019 The original publication is available at www.metallurgical-research.org |
URI: | http://hdl.handle.net/2433/244873 |
DOI(出版社版): | 10.1051/ro/2019001 |
出現コレクション: | 学術雑誌掲載論文等 |
このリポジトリに保管されているアイテムはすべて著作権により保護されています。