  We 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.
