On one planning problem in linear models class

The paper is concerned with a problem of planning which can be formulated as a mathematical programming problem with restrictions in the form of a system of linear inequalities. When such system of linear inequalities is incompatible under fixed right-hand side vector, a method of correcting this vector is proposed, which permits one to find a vector most close (in a centain sense) to the initial correcting vector of right-hand side and provides compatibility of the system of restrictions in planning problem. Considered in the paper is an application of the correcting method to some two-level planning problems with restrictions in the form of incompatible linear inequalities.