A multiobjective interior primal-dual linear programming algorithm (Q1318462)

From MaRDI portal
Revision as of 13:19, 22 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A multiobjective interior primal-dual linear programming algorithm
scientific article

    Statements

    A multiobjective interior primal-dual linear programming algorithm (English)
    0 references
    0 references
    27 March 1994
    0 references
    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.
    0 references
    0 references
    primal-dual interior point algorithm
    0 references
    multiobjective linear programming
    0 references

    Identifiers