Geodesic
A mathematical programming problem with a convex irregular feasible set
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 30 (1990) no. 6, pp. 844-857 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

An exact and an approximate method for reducing a mathematical programming problem with a convex irregular feasible set to a mathematical programming problem with a regular feasible set is proposed. 
@article{ZVMMF_1990_30_6_a4,
     author = {V. N. Nefedov},
     title = {A~mathematical programming problem with a~convex irregular feasible set},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {844--857},
     year = {1990},
     volume = {30},
     number = {6},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1990_30_6_a4/}
}
TY  - JOUR
AU  - V. N. Nefedov
TI  - A mathematical programming problem with a convex irregular feasible set
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1990
SP  - 844
EP  - 857
VL  - 30
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1990_30_6_a4/
LA  - ru
ID  - ZVMMF_1990_30_6_a4
ER  - 
%0 Journal Article
%A V. N. Nefedov
%T A mathematical programming problem with a convex irregular feasible set
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1990
%P 844-857
%V 30
%N 6
%U http://geodesic.mathdoc.fr/item/ZVMMF_1990_30_6_a4/
%G ru
%F ZVMMF_1990_30_6_a4
V. N. Nefedov. A mathematical programming problem with a convex irregular feasible set. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 30 (1990) no. 6, pp. 844-857. http://geodesic.mathdoc.fr/item/ZVMMF_1990_30_6_a4/

[1] Karmanov V. G., Matematicheskoe programmirovanie, Nauka, M., 1986 | MR

[2] Vasilev F. P., Chislennye metody resheniya ekstremalnykh zadach, Nauka, M., 1980 | MR

[3] Belousov E. G., Vvedenie v vypuklyi analiz i tselochislennoe programmirovanie, Izd-vo MGU, M., 1977 | MR | Zbl

[4] Nefedov V. N., Metody svedeniya zadachi vypuklogo programmirovaniya, ne udovletvoryayuschei usloviyu Sleitera, k zadache vypuklogo programmirovaniya, udovletvoryayuschei usloviyu Sleitera, Dep. v VINITI, No 2092-V88, 1988

[5] Nefedov V. N., O poluchenii verkhnei otsenki dlya rasstoyaniya po Khausdorfu mezhdu tochnym i vozmuschennym mnozhestvami, zadannymi vypuklymi polinomialnymi ogranicheniyami tipa neravenstv, Dep. v VINITI, No 293-V89, 1989

[6] Belousov E. G., Bank B. (red.), Matematicheskaya optimizatsiya: voprosy razreshimosti i ustoichivosti, Izd-vo MGU, M., 1986