Об одном свойстве задачи линейного программирования с псевдоинтервальными переменными

The optimization task with linear constraints of pseudo-interval variables is discussed in the article. It is proofed that if the task has optimal solution, then there is a solution that has not more than $M$ non-zero variables ($M$ is the number of constraints of the task).