Back to Search
Start Over
Conditions When the Problems of Linear Programming Are Algorithmically Unsolvable.
- Source :
-
Axioms (2075-1680) . May2024, Vol. 13 Issue 5, p293. 9p. - Publication Year :
- 2024
-
Abstract
- We study the properties of the constructive linear programming problems. The parameters of linear functions in such problems are constructive real numbers. Solving such a problem involves finding the optimal plan with the constructive real number components. We show that it is impossible to have an algorithm that solves an arbitrary constructive real programming problem. [ABSTRACT FROM AUTHOR]
- Subjects :
- *REAL numbers
*CONSTRUCTIVE mathematics
*PROBLEM solving
Subjects
Details
- Language :
- English
- ISSN :
- 20751680
- Volume :
- 13
- Issue :
- 5
- Database :
- Academic Search Index
- Journal :
- Axioms (2075-1680)
- Publication Type :
- Academic Journal
- Accession number :
- 177460071
- Full Text :
- https://doi.org/10.3390/axioms13050293