Skip to main content
Conference Proceedings

An algorithm for generating efficient outcome points for convex multiobjective programming problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 5991 LNAI(PART 2) 390-399
DOI: 10.1007/978-3-642-12101-2_40
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this article we propose a quite easy algorithm for generating efficient outcome points for convex multiobjective programming problems. To illustrate the performance of the new algorithm, we use it to generate efficient points for a sample problem. © 2010 Springer-Verlag Berlin Heidelberg.

Author supplied keywords

Cite

CITATION STYLE

APA

Kim, N. T. B., & Thuy, L. Q. (2010). An algorithm for generating efficient outcome points for convex multiobjective programming problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5991 LNAI, pp. 390–399). https://doi.org/10.1007/978-3-642-12101-2_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free