On an inverse linear programming problem
- Авторлар: Amirkhanova G.A.1, Golikov A.I.2, Evtushenko Y.G.2
-
Мекемелер:
- Institute for Information and Computing Technologies
- Dorodnitsyn Computing Center
- Шығарылым: Том 295, № Suppl 1 (2016)
- Беттер: 21-27
- Бөлім: Article
- URL: https://journals.rcsi.science/0081-5438/article/view/174026
- DOI: https://doi.org/10.1134/S0081543816090030
- ID: 174026
Дәйексөз келтіру
Аннотация
A method for solving the following inverse linear programming (LP) problem is proposed. For a given LP problem and one of its feasible vectors, it is required to adjust the objective function vector as little as possible so that the given vector becomes optimal. The closeness of vectors is estimated by means of the Euclidean vector norm. The inverse LP problem is reduced to a problem of unconstrained minimization for a convex piecewise quadratic function. This minimization problem is solved by means of the generalized Newton method.
Авторлар туралы
G. Amirkhanova
Institute for Information and Computing Technologies
Email: evt@ccas.ru
Қазақстан, Almaty, 050010
A. Golikov
Dorodnitsyn Computing Center
Хат алмасуға жауапты Автор.
Email: evt@ccas.ru
Ресей, Moscow, 119333
Yu. Evtushenko
Dorodnitsyn Computing Center
Email: evt@ccas.ru
Ресей, Moscow, 119333
Қосымша файлдар
