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.

• PostScript (in Russian) (3.31MB)
• PDF (in Russian) (2.35MB)



• PostScript. zip (in Russian) (1.51MB)
• PDF. zip (in Russian) (1.02MB)