Article ID: | iaor20053313 |
Country: | Netherlands |
Volume: | 161 |
Issue: | 3 |
Start Page Number: | 663 |
End Page Number: | 672 |
Publication Date: | Mar 2005 |
Journal: | European Journal of Operational Research |
Authors: | Troutt Marvin D., Tadisina Suresh K., Brandyberry Alan A., Sohn Changsoo |
We define a version of the Inverse Linear Programming problem that we call Linear Programming System Identification. This version of the problem seeks to identify both the objective function coefficient vector and the constraint matrix of a linear programming problem that best fits a set of observed vector pairs. One vector is that of actual decisions that we call outputs. These are regarded as approximations of optimal decision vectors. The other vector consists of the inputs or resources actually used to produce the corresponding outputs. We propose an algorithm for approximating the maximum likelihood solution. The major limitation of the method is the computation of exact volumes of convex polytopes. A numerical illustration is given for simulated data.