Voir la notice de l'article provenant de la source Math-Net.Ru
@article{IVM_1999_3_a3, author = {G. G. Islamov}, title = {On the polyhedral solvability of a~system of linear differential equations}, journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika}, pages = {31--37}, publisher = {mathdoc}, number = {3}, year = {1999}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/IVM_1999_3_a3/} }
G. G. Islamov. On the polyhedral solvability of a~system of linear differential equations. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 3 (1999), pp. 31-37. http://geodesic.mathdoc.fr/item/IVM_1999_3_a3/
[1] Islamov G. G., “Kriterii razreshimosti uravnenii s kraevymi neravenstvami”, Izv. otd. matem. i informatiki UdGU, no. 2, Izhevsk, 1994, 3–24 | Zbl
[2] Maksimov V. P., Rumyantsev A. N., “Kraevye zadachi i zadachi impulsnogo upravleniya v ekonomicheskoi dinamike. Konstruktivnoe issledovanie”, Izv. vuzov. Matematika, 1993, no. 5, 56–71 | MR
[3] Chernikov S. N., Lineinye neravenstva, Nauka, M., 1968, 488 pp. | MR | Zbl
[4] Ashmanov S. A., Lineinoe programmirovanie, Ucheb. posobie, Nauka, M., 1981, 304 pp. | Zbl
[5] Emelichev V. A., Kovalev M. M., Kravtsov M. K., Mnogogranniki, grafy, optimizatsiya (kombinatornaya teoriya mnogogrannikov), Nauka, M., 1981, 341 pp. | MR
[6] Kristofides N., Teoriya grafov. Algoritmicheskii podkhod, Mir, M., 1978, 432 pp. | MR
[7] Svami M., Tkhulasiraman K., Grafy, seti i algoritmy, Mir, M., 1984, 455 pp.
[8] Romanovskii I. V., Algoritmy resheniya ekstremalnykh zadach, Nauka, M., 1977, 352 pp. | MR
[9] Eremin I. I., Astafev N. N., Vvedenie v teoriyu lineinogo i vypuklogo programmirovaniya, Ucheb. posobie, Nauka, M., 1976, 191 pp. | MR
[10] Venttsel E. S., Ovcharov L. A., Teoriya sluchainykh protsessov i ee inzhenernye prilozheniya, Nauka, M., 1991, 384 pp. | MR