Geodesic
Numerical solution of bilinear programming problems
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 48 (2008) no. 2, pp. 237-254

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

A bilinear programming problem with uncoupled variables is considered. First, a special technique for generating test bilinear problems is considered. Approximate algorithms for local and global search are proposed. Asymptotic convergence of these algorithms is analyzed, and stopping rules are proposed. In conclusion, numerical results for randomly generated bilinear problems are presented and analyzed. 
@article{ZVMMF_2008_48_2_a5,
     author = {A. V. Orlov},
     title = {Numerical solution of bilinear programming problems},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {237--254},
     publisher = {mathdoc},
     volume = {48},
     number = {2},
     year = {2008},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2008_48_2_a5/}
}
TY  - JOUR
AU  - A. V. Orlov
TI  - Numerical solution of bilinear programming problems
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2008
SP  - 237
EP  - 254
VL  - 48
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2008_48_2_a5/
LA  - ru
ID  - ZVMMF_2008_48_2_a5
ER  - 
%0 Journal Article
%A A. V. Orlov
%T Numerical solution of bilinear programming problems
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2008
%P 237-254
%V 48
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZVMMF_2008_48_2_a5/
%G ru
%F ZVMMF_2008_48_2_a5
A. V. Orlov. Numerical solution of bilinear programming problems. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 48 (2008) no. 2, pp. 237-254. http://geodesic.mathdoc.fr/item/ZVMMF_2008_48_2_a5/