Geodesic
Numerical solution of bilinear programming problems
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 48 (2008) no. 2, pp. 237-254 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

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},
     year = {2008},
     volume = {48},
     number = {2},
     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
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
%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/

[1] Vasilev F. P., Metody optimizatsii, Faktorial Press, M., 2002

[2] Polyak B. T., Vvedenie v optimizatsiyu, Nauka, M., 1983 | MR

[3] Horst R., Tuy H., Global optimization. Deterministic approaches, Springer, Berlin, 1993 | MR

[4] Cmpekalovskii A. C., Elementy nevypukloi optimizatsii, Nauka, Novosibirsk, 2003

[5] Strekalovskii A. S., “O minimizatsii raznosti vypuklykh funktsii na dopustimom mnozhestve”, Zh. vychisl. matem. i matem. fiz., 43:3 (2003), 399–409 | MR | Zbl

[6] Horst R.,Thoai N. V., “D. C. programming: Overview”, J. Optimizat. Theory and Applic., 103:1 (1999), 1–43 | DOI | MR

[7] Floudas C. A., Visweswaran V., “Quadratic optimization”, Handbook of Global Optimization, Kluwer Acad. Publ., Dordrecht, 1995, 217–269 | MR | Zbl

[8] Mukhamediev B. M., “O reshenii zadachi bilineinogo programmirovaniya i otyskanii vsekh situatsii ravnovesiya v bimatrichnykh igrakh”, Zh. vychisl. matem. i matem. fiz., 18:2 (1978), 351–359 | MR

[9] Orlov A. B., Strekalovskii A. C., “O poiske situatsii ravnovesiya v bimatrichnykh igrakh”, Avtomatika i telemakhan., 2004, no. 2, 55–68 | MR | Zbl

[10] Orlov A. B., Strekalovskii A. C., “O chislennom poiske situatsii ravnovesiya v bimatrichnykh igrakh”, Zh. vychisl. matem. i matem. fiz., 45:6 (2005), 983–997 | MR | Zbl

[11] Bennet K. P., Mancasaryan O. L., “Bilinear separation of two sets in $n$-space”, Comput. Optimizat. and Applic., 2 (1993), 207–227 | DOI | MR | Zbl

[12] Mangasarian O. L., “The linear complementarity problem as a separable bilinear program”, J. Global Optimizat., 12 (1995), 1–7 | MR

[13] Konno H., Bilinear programming. Part. II: Applications of bilinear programming, Techn. Rep. 71-10, Dept. of OR Standford Univ., 1971

[14] Sokiryanskaya E. H., “Nekotorye algoritmy bilineinogo programmirovaniya”, Kibernetika, 1974, no. 4, 106–112 | Zbl

[15] Barantsev A. R., Issledovanie po bilineinomu programmirovaniyu i klasternomu analizu, Dis. $\dots$ kand. fiz.-matem. nauk, SPbU, Sankt-Peterburg, 1997

[16] Alaire S., Audet C., Jaumard B., Savard G., “Concavity cuts for disjoint bilinear programming”, Math. Program., 90:2 (1999), 373–398 | DOI | MR

[17] Vicente L. N., Calamai P. H., Judice J. J., “Generation of disjointly constrained bilinear programming test problems”, Comput. Optimizat. and Applic., 1:3 (1992), 299–306 | MR | Zbl

[18] Kalitkin H. H., Chislennye metody, Gosfizmatlit, M., 1978

[19] Ashmanov C. A., Lineinoe programmirovanie, Nauka, M., 1981 | Zbl

[20] Hiriart-Urruty J. B., “Generalized differentiability, duality and optimization for problem dealing with differences of convex functions”, Lect. Notes in Economics and Math. Systems, 256, Springer, Berlin, 1985, 37–69 | MR