On an inverse linear programming problem

From MaRDI portal
Publication:2396367





This article presents an optimization method to solve an inverse linear programming problem, namely the problem of adjusting the objective function vector in such a way that a given feasible solution will be optimal. The paper begins with an overview of the literature and a presentation of the notation used, followed by a method to convert this problem into an unconstrained minimization problem with a convex piecewise quadratic function. Several properties of this problem are presented as well as a method for its solution.




Cited in
(37)








This page was built for publication: On an inverse linear programming problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2396367)