Geodesic
A synthesis of simplex and linear correction methods for linear optimization problems with unformalized restrictions
Numerical methods and programming, Tome 6 (2005) no. 1, pp. 226-238 
A synthesis of simplex and linear correction methods for linear optimization problems with unformalized restrictions. Numerical methods and programming, Tome 6 (2005) no. 1, pp. 226-238. http://geodesic.mathdoc.fr/item/VMP_2005_6_1_a20/
@misc{VMP_2005_6_1_a20,
     title = {A synthesis of simplex and linear correction methods for linear optimization problems with unformalized restrictions},
     journal = {Numerical methods and programming},
     pages = {226--238},
     year = {2005},
     volume = {6},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMP_2005_6_1_a20/}
}
TY  - JOUR
TI  - A synthesis of simplex and linear correction methods for linear optimization problems with unformalized restrictions
JO  - Numerical methods and programming
PY  - 2005
SP  - 226
EP  - 238
VL  - 6
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/VMP_2005_6_1_a20/
LA  - ru
ID  - VMP_2005_6_1_a20
ER  - 
%0 Journal Article
%T A synthesis of simplex and linear correction methods for linear optimization problems with unformalized restrictions
%J Numerical methods and programming
%D 2005
%P 226-238
%V 6
%N 1
%U http://geodesic.mathdoc.fr/item/VMP_2005_6_1_a20/
%G ru
%F VMP_2005_6_1_a20

Voir la notice de l'article provenant de la source Math-Net.Ru

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.