Add to ORKGWe study the properties of the constructive linear programing problems. The parameters of linear functions in such problems are constructive real numbers. To solve such a problem is to find 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.Comment: 7 page
AbstractUsing predicate logic, the concept of a linear problem is formalized. The class of linear pr...
AbstractIt is shown that any bounded integer linear programming problem can be trans- formed to an e...
AbstractWe describe an algorithm that first decides whether the primal-dual pair of linear programsm...
A real number x is constructive if an algorithm can be given to compute arbitrarily accurate approxi...
For a complexity class $C$ and language $L$, a constructive separation of $L \notin C$ gives an effi...
The first part of the paper introduces the varieties of modern constructive mathematics, concentrati...
The complexity of linear programming is discussed in the "integer" and "real number" models of compu...
AbstractThis paper introduces Bishop's constructive mathematics, which can be regarded as the constr...
AbstractWe present a new linear-programming algorithm that is simple, effective, fully parallelizabl...
LU and Cholesky matrix factorization algorithms are core subroutines used to solve systems of linear...
It is well known how to clarify whether there is a polynomial time simplex algorithm for linear prog...
Linear programming is a key technique for analysis and verification of numerical properties in progr...
Summary form only given. Integer programming is the problem of maximizing a linear function over the...
Instances generation is crucial for linear programming algorithms, which is necessary either to find...
Introduction to Linear Programming Linear programming is a very important class of problems, both a...
AbstractUsing predicate logic, the concept of a linear problem is formalized. The class of linear pr...
AbstractIt is shown that any bounded integer linear programming problem can be trans- formed to an e...
AbstractWe describe an algorithm that first decides whether the primal-dual pair of linear programsm...
A real number x is constructive if an algorithm can be given to compute arbitrarily accurate approxi...
For a complexity class $C$ and language $L$, a constructive separation of $L \notin C$ gives an effi...
The first part of the paper introduces the varieties of modern constructive mathematics, concentrati...
The complexity of linear programming is discussed in the "integer" and "real number" models of compu...
AbstractThis paper introduces Bishop's constructive mathematics, which can be regarded as the constr...
AbstractWe present a new linear-programming algorithm that is simple, effective, fully parallelizabl...
LU and Cholesky matrix factorization algorithms are core subroutines used to solve systems of linear...
It is well known how to clarify whether there is a polynomial time simplex algorithm for linear prog...
Linear programming is a key technique for analysis and verification of numerical properties in progr...
Summary form only given. Integer programming is the problem of maximizing a linear function over the...
Instances generation is crucial for linear programming algorithms, which is necessary either to find...
Introduction to Linear Programming Linear programming is a very important class of problems, both a...
AbstractUsing predicate logic, the concept of a linear problem is formalized. The class of linear pr...
AbstractIt is shown that any bounded integer linear programming problem can be trans- formed to an e...
AbstractWe describe an algorithm that first decides whether the primal-dual pair of linear programsm...