Finding Efficient Points in Multiobjective Quadratic Programming with Strictly Convex Objective Functions-Reference-Cited by-同舟云学术

Finding Efficient Points in Multiobjective Quadratic Programming with Strictly Convex Objective Functions

Published:1997 Issue: Volume: Page:365-373
ISSN:0075-8442
Container-title:Lecture Notes in Economics and Mathematical Systems
language:
Short-container-title:

Author:

Beato-Moreno A.,Luque-Calvo P.,Osuna-Gómez R.,Rufián-Lizana A.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-46854-4_40.pdf

Reference5 articles.

1. Beato-Moreno, A. Eficiencia en Programación Cuadrdtica Multiobjetivo. Ph. D. Thesis (Unpublished), 1995.

2. Chankong, V. and Haimes, Y. Y. Multiobjective Decision Making: Theory and Methodology. Elsevier Science Publishing Co. Inc., North-Holland, 1983.

3. Gantmacher, F.R. The Theory of Matrices. Vol I and II. Chelsea Publishing Company, New York, N.Y., 1959.

4. Ruiz-Canales, P.–Rufian Lizana, A. A Characterization of Weakly Efficient Points. Mathematical Programming. Vol 68 (1995), N. 2, pp. 205–212.

5. Warburton, A.R. Quasiconcave Vectir Maximization: Connectedness of the Set Pareto-Optimal and Weak Pareto-Optimal Alternatives. Journal of Optimization Theory and Applicattions. Vol. 40 (1983), PP. 537–557.

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

1. An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization;Optimization Letters;2022-09-29

2. Continuous Multiobjective Programming;Multiple Criteria Decision Analysis;2016

3. Mutiobjective Programming;International Series in Operations Research & Management Science