On Solving Optimization Problems with Inexact Data.

There are considered two kinds of optimization problems with interval uncertainty. The first kind is interval linear programming (ILP), the second kind is finding equilibrium position for interval von Neumann's model (bilinear problem). Definitions of different types of solutions for both kinds of problems and methods for finding these solutions are given. These methods imply using matrices of upper and lower bounds of initial interval data and reducing interval optimization problems to exact (ordinary) linear programming problems.