Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Dantsig Dzh., Lineinoe programmirovanie, ego obobscheniya i primenenie, Progress, M., 1966
[2] Pervozvanskii A. A., Matematicheskie modeli v upravlenii proizvodstvom, Nauka, M., 1975 | MR
[3] Timokhin S. G., Shapkin A. V., “O zadachakh lineinogo programmirovaniya v usloviyakh netochnykh dannykh”, Ekonomika i matem. metody, 17:5 (1981), 955–963 | MR
[4] Vatolin A. A., “O zadachakh lineinogo programmirovaniya s intervalnymi koeffitsientami”, Zh. vychisl. matem. i matem. fiz., 24:11 (1984), 1629–1637 | MR | Zbl
[5] Soyster A. L., “Convex programming with set-inclusive constraints and applications to inexact linear programming”, Operat. Res., 21:5 (1973), 1154–1157 | DOI | MR | Zbl
[6] Falk J. E., “Exact solutions of inexact linear programs”, Operat. Res., 24:4 (1976), 783–786 | DOI | MR
[7] Agayan G. M., Ryutin A. A., Tikhonov A. N., “O zadachakh lineinogo programmirovaniya s priblizhennymi dannymi”, Zh. vychisl. matem. i matem. fiz., 24:9 (1984), 1303–1311 | MR | Zbl
[8] Ramik Ya., Rimanek I., “Lineinye ogranicheniya s netochnymi dannymi”, Izv. AN SSSR. Tekhn. kibernetika, 1987, no. 2, 41–48 | Zbl
[9] Libura M., “Integer programming problems with inexact objective function”, Control and Cybernetica, 9:4 (1980), 189–202 | MR | Zbl
[10] Roschin V. A., Semenova H. V., Sergienko I. V., “Voprosy resheniya i issledovaniya odnogo klassa zadach netochnogo tselochislennogo programmirovaniya”, Kibernetika, 1989, no. 2, 42–47
[11] Semenova N. V., “Reshenie odnoi zadachi obobschennogo tselochislennogo programmirovaniya”, Kibernetika, 1984, no. 5, 25–31 | MR | Zbl