On an inverse linear programming problem


Дәйексөз келтіру

Толық мәтін

Ашық рұқсат Ашық рұқсат
Рұқсат жабық Рұқсат берілді
Рұқсат жабық Тек жазылушылар үшін

Аннотация

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

Қосымша файлдар

Қосымша файлдар
Әрекет
1. JATS XML

© Pleiades Publishing, Ltd., 2016