On an inverse linear programming problem (Q2396367)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On an inverse linear programming problem |
scientific article; zbMATH DE number 6727001
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On an inverse linear programming problem |
scientific article; zbMATH DE number 6727001 |
Statements
On an inverse linear programming problem (English)
0 references
8 June 2017
0 references
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.
0 references
linear programming
0 references
inverse linear programming problem
0 references
duality
0 references
unconstrained optimization
0 references
generalized Newton method
0 references
0 references
0.94560474
0 references
0 references
0.92878264
0 references
0.9187132
0 references
0.9155872
0 references
