Inverse Optimization

In this paper, we study inverse optimization problems defined as follows. Let S denote the set of feasible solutions of an optimization problem P , let c be a specified cost vector, and x 0 be a given feasible solution. The solution x 0 may or may not be an optimal solution of P with respect to the...

Full description

Saved in:

Bibliographic Details
Published in:	Operations research Vol. 49; no. 5; pp. 771 - 783
Main Authors:	Ahuja, Ravindra K, Orlin, James B
Format:	Journal Article
Language:	English
Published:	Linthicum INFORMS 01.09.2001 Institute for Operations Research and the Management Sciences
Subjects:	Algorithms Convex analysis Cost efficiency Graphs Integer programming Inverse problems Linear programming Logic programming Mathematical minima Mathematical models Mathematical optimization Mathematical vectors Mathematics Minimization of cost Network management systems Networks graphs, flow algorithms: inverse shortest path, minimum cut, minimum cost flows Operations research Optimal solutions Optimization Parameter estimation Programming, linear: inverse linear programming problems Studies Systems engineering Transportation, mass transit: toll pricing in mass transportation networks Unit costs Variable costs United States
ISSN:	0030-364X, 1526-5463
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!