| Autor: |
Elsayed Badr, I.M. Selim, Hoda Mostafa, Hala Attiya |
| Jazyk: |
angličtina |
| Rok vydání: |
2022 |
| Předmět: |
|
| Zdroj: |
Journal of Mathematics, Vol 2022 (2022) |
| Druh dokumentu: |
article |
| ISSN: |
2314-4785 |
| DOI: |
10.1155/2022/7660174 |
| Popis: |
Linear programming is an important approach that is used to represent a large class of combinatorial optimization problems. The simplex algorithm is one of the algorithms for solving linear programming problems with exponential time complexity. Fortunately, this algorithm solves real-world problems with polynomial time complexity. In particular, a new Integer Linear Programming model (ILPM) is proposed for partially ordered sets. Robert Dilworth’s Decomposition theorem is formulated by ILPM and proves its correctness using the paradigm of strong duality in linear programming. Finally, ILPM is run on fifteen benchmark partially ordered sets for finding their width. The computational experiments show the validity of the proposed model. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
Plný text