NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
A scalable parallel algorithm for multiple objective linear programsThis paper presents an ADBASE-based parallel algorithm for solving multiple objective linear programs (MOLP's). Job balance, speedup and scalability are of primary interest in evaluating efficiency of the new algorithm. Implementation results on Intel iPSC/2 and Paragon multiprocessors show that the algorithm significantly speeds up the process of solving MOLP's, which is understood as generating all or some efficient extreme points and unbounded efficient edges. The algorithm gives specially good results for large and very large problems. Motivation and justification for solving such large MOLP's are also included.
Document ID
19940033028
Acquisition Source
Legacy CDMS
Document Type
Preprint (Draft being sent to journal)
Authors
Wiecek, Malgorzata M.
(Clemson Univ. SC., United States)
Zhang, Hong
(Clemson Univ. SC., United States)
Date Acquired
September 6, 2013
Publication Date
June 1, 1994
Subject Category
Computer Programming And Software
Report/Patent Number
NASA-CR-194920
NAS 1.26:194920
AD-A283545
ICASE-94-38
Accession Number
94N37539
Funding Number(s)
PROJECT: RTOP 505-90-52-01
CONTRACT_GRANT: NSF DMS-93-08605
CONTRACT_GRANT: NAS1-19480
Distribution Limits
Public
Copyright
Work of the US Gov. Public Use Permitted.
No Preview Available