Multicriteria Integer Zero-One Programming: A Tree-Search Type Algorithm.

Abstract

An algorithm for zero-one integer programming problems with more than one objective functions is developed, implemented and tested. For a multiobjective problem the notion of optimality must be replaced with that of efficiency. A solution is said to be efficient if it satisfies the constraints and no other solution satisfying them scores as well with respect to all objective functions and better with respect to at least one of them. In the presented algorithm, the problem variables are partitioned into two sets; those whose coefficients in the objective functions are all of the same sign, and the remainder. A tree search implicit enumeration algorithm based on this partition is developed and computational results are presented. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1977
Accession Number
ADA050244

Entities

People

  • Aggelos Konstantinou Simopoulos

Organizations

  • Naval Postgraduate School

Tags

DTIC Thesaurus Topics

  • Additives (Chemicals)
  • Algorithms
  • California
  • Coefficients
  • Computer Programming
  • Computer Programs
  • Computer Science
  • Computers
  • Efficiency
  • Integer Programming
  • Linear Programming
  • Mathematical Programming
  • Notation
  • Operations Research
  • Procedures (Computers)
  • Schools
  • Statistics

Readers

  • Operations Research