Information model for solving the infeasible problem of optimal production planning

The article deals with the problem of interpretation of an infeasible solution for a large-scale of the problem of optimal production planning. The formulation of the problem of optimal planning refinery is given. This formulation of the problem provides a solution by the method of successive linear programming (SLP). The complexity of the interpretation of infeasible constraints for large-scale planning problems is shown. A method of sequential choice of variants for the analysis of infeasible constraints is proposed. This way of selecting options has been tested on plant models. This tool was used in training specialists and in developing models of plants. The justification of the proposed method for selecting the variant for the analysis of infeasible constraints is given, based on the geometry of constraint space. An example of infeasible constraints is the increase in the complexity of interpreting the causes of the infeasible solution with the increase in the dimension of the problem. This is well matched with the solution experience and known data for a large-scale of the optimization problems.