A synthesis of simplex and linear correction methods for linear optimization problems with unformalized restrictions

This paper is devoted to solving the linear optimization problems with unformalized restrictions. We propose a method based on a synthesis of simplex and linear correction methods. Our method demands an expert capable to find out whether a point satisfies the unformalized restriction under consideration. The paper describes an implementation of our method in the form of a program package in the C language. Some results of computing experiments confirming the efficiency of our approach are discussed.