Sign inSubmit
ArticleMetrics
Research Article · Free to read · Published 30 September 2007

Detecting Non-Dominated Extreme Points for Multiple Objective Linear Programming

S. F. Tantawy

Journal of Mathematics and Statistics, Volume 3, Issue 3, pp. 77–79 · doi.org/10.3844/jmssp.2007.77.79

6,862 accesses4,716 downloads1 citations (Crossref)Metrics
Cite Check for updates

Abstract

Efficient extreme points in decision space of multiple objective linear programming (MOLP) may not map to non dominated extreme points in objective space under the linear mapping, condition that efficient extreme points have a non dominated extreme is given, the important of this study is that the decision-Maker may depends on extreme points of the set of the objective space than that of the decision space since they have fewer extreme points.

Licence and reuse

Free to read. This article carries the publisher’s copyright, as printed on it: © 2007 Science Publications. It is free to read; ask us before reusing it.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

Tantawy, S. F. (2007). Detecting Non-Dominated Extreme Points for Multiple Objective Linear Programming. Journal of Mathematics and Statistics, 3(3), 77–79. https://doi.org/10.3844/jmssp.2007.77.79

Licence
© Science Publications
Issue
Volume 3, Issue 3
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
Detecting Non-Dominated Extreme Points for Multiple Objective Linear ProgrammingJournal of Mathematics and Statistics · Volume 3, Issue 3 · pp. 77–79 · © Science PublicationsDownload