Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 20, 1989 - Issue 4
33
Views
12
CrossRef citations to date
0
Altmetric
Original Articles

Solving multiobjective programming problems by discrete representation

Pages 483-492 | Received 01 Mar 1987, Published online: 27 Jun 2007

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (1)

Renu Gupta & M. C. Puri. (2000) Bicriteria integer quadratic programming problems. Journal of Interdisciplinary Mathematics 3:2-3, pages 133-148.
Read now

Articles from other publishers (11)

Golbarg Kazemi Tutunchi & Yahya Fathi. (2020) Representative subsets of non-dominated points in the bi-criteria p-median p-dispersion problem. Computers & Industrial Engineering 146, pages 106400.
Crossref
Margaret M. Wiecek, Matthias Ehrgott & Alexander Engau. 2016. Multiple Criteria Decision Analysis. Multiple Criteria Decision Analysis 739 815 .
Stacey L. Faulkenberg & Margaret M. Wiecek. (2011) Generating equidistant representations in biobjective programming. Computational Optimization and Applications 51:3, pages 1173-1210.
Crossref
Stacey L. Faulkenberg & Margaret M. Wiecek. (2009) On the quality of discrete representations in multiple objective programming. Optimization and Engineering 11:3, pages 423-440.
Crossref
. 2006. Soft Computing For Complex Multiple Criteria Decision Making. Soft Computing For Complex Multiple Criteria Decision Making 45 56 .
S. Ruzika & M. M. Wiecek. (2005) Approximation Methods in Multiobjective Programming. Journal of Optimization Theory and Applications 126:3, pages 473-501.
Crossref
Jacinto Martín, Concha Bielza & David Ríos Insua. (2005) Approximating nondominated sets in continuous multiobjective optimization problems. Naval Research Logistics (NRL) 52:5, pages 469-480.
Crossref
Serpil Sayin. (2003) A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors. Operations Research 51:3, pages 427-436.
Crossref
Harold P. Benson & Erjiang Sun. (2002) A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program. European Journal of Operational Research 139:1, pages 26-41.
Crossref
H. P. Benson. (1998) Hybrid Approach for Solving Multiple-Objective Linear Programs in Outcome Space. Journal of Optimization Theory and Applications 98:1, pages 17-35.
Crossref
Rüdiger Armann. 1992. Operations Research Proceedings 1991. Operations Research Proceedings 1991 593 599 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.