Finding efficient points for linear multiple objective programs-Reference-Cited by-同舟云学术

Finding efficient points for linear multiple objective programs

Published:1975-12 Issue:1 Volume:8 Page:375-377
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Ecker J. G.,Kouada I. A.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01580453.pdf

Reference8 articles.

1. K.J. Arrow, E.W. Barankin and D. Blackwell, “Admissible points of convex sets”, in: H.W. Kuhn and A.W. Tucker, eds.,Contributions to the theory of games (Princeton University Press, Princeton, N.J., 1953) pp. 87–91.

2. A. Charnes and W.W. Cooper,Management models and industrial applications of linear programming, Vol. 1 (Wiley, New York, 1961) 299–310.

3. J.P. Evans and R.E. Steuer, “A revised simplex method for linear multiple objective programs”,Mathematical Programming 5 (1973) 54–72.

4. A.M. Geoffrion, “Proper efficiency and the theory of vector maximization”,Journal of Mathematical Analysis and Applications 22 (1968) 618–630.

5. H. Isermann, “Proper efficiency and the linear vector maximization problem”,Operations Research 22 (1974) 189–191.

Cited by 108 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimization of a linear function over an integer efficient set;Journal of Industrial and Management Optimization;2023

2. Optimizing over the efficient set of the binary bi-objective knapsack problem;Yugoslav Journal of Operations Research;2023

3. Parallel optimization over the integer efficient set;International Transactions in Operational Research;2022-08-17

4. A survey on links between multiple objective decision making and data envelopment analysis;Multi-Objective Combinatorial Optimization Problems and Solution Methods;2022

5. Optimizing a linear function over an efficient set;Operational Research;2021-08-05