A Bookkeeping Strategy for Multiple Objective Linear Programs.

Abstract

This paper discusses the bookkeeping strategies for solving large multiple objective linear programs (MOLPs) on ADBASE, a well developed sequential software package, and on a parallel ADBASE algorithm. Three representative list creation schemes were first analyzed and tested. The best of them, Binary Search with Insertion Sort (BSIS), was selected to be incorporated into ADBASE and the parallel ADBASE algorithm. The resulting new bookkeeping strategy was then tested in ADBASE as well as implemented in the parallel ADBASE algorithm. The parallel implementations were carried out on an Intel Paragon multiprocessor. Computational results show that the new bookkeeping strategy for maintaining a list of efficient solutions significantly speeds up the process of solving MOLPs, especially on parallel computers.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1997
Accession Number
ADA323730

Entities

People

  • Alok Aurovillian
  • Hong Zhang
  • Malgorzata M. Wiecek

Tags

Communities of Interest

  • Energy and Power Technologies
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computational Complexity
  • Computations
  • Computer Programming
  • Computer Programs
  • Computers
  • Efficiency
  • Engineering
  • Evolutionary Algorithms
  • Linear Programming
  • Lists (Data Structures)
  • Mathematical Programming
  • Operations Research
  • Parallel Computing
  • Parallel Processing
  • Procedures (Computers)
  • Processing Equipment

Readers

  • Military Logistics and Supply Chain Management
  • Parallel and Distributed Computing.