Abstract
This paper presents an interactive interior point algorithm for determining a best compromise solution to a multiple objective linear programming problem in situations with an implicitly defined utility function.
We construct a sequence of a smaller and smaller polytopes which shrink towards the compromise solution.
The algorithm generates a sequence of points, each of them in the interior of polytopes in sequence, by maximizing a linear function over an ellipsoid.
|