
An extension is given of the primal-dual interior point algorithm for linear programming created by \textit{K. A. McShane}, \textit{C. L. Monma} and \textit{D. Shanno} [ORSA J. Comput. 1, No. 2, 70-83 (1989; Zbl 0752.90047)], and other authors. This generalization is directed to the solution of multiobjective linear programming problems including an implicitly-known utility function given by the decision maker such that one point of the efficient solution set will be terminated. Some numerical results are presented.
primal-dual interior point algorithm, Linear programming, multiobjective linear programming, Multi-objective and goal programming
primal-dual interior point algorithm, Linear programming, multiobjective linear programming, Multi-objective and goal programming
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 5 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
