Vague matrices in linear programming
This paper deals with so-called vague matrices, the columns of which are convex sets. A special “square” problem of the vague optimization is analysed. The results form a base for the subsequent outline of an algorithm for solving the LP-problem with a vague matrix. The paper is concluded by the discussion of possible types of degeneracy.