Linear Multiple Objective Problems with Interval Coefficients.

Abstract

This paper considers linear multiple objective programs with coefficients of the criteria given by intervals. This class of problems is of practical interest since in many instances it is difficult to determine precisely the coefficients of the objective functions. A subproblem to test if a feasible extreme point is efficient in the problem considered is obtained. A branch and bound algorithm to solve the subproblem as well as computational results are provided. Extensions are discussed.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1979
Accession Number
ADA073967

Entities

People

  • Gabriel R. Bitran

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • C4I
  • Human Systems

DTIC Thesaurus Topics

  • Algorithms
  • Coefficients
  • Computer Programming
  • Computer Programs
  • Computers
  • Intervals
  • Investments
  • Linear Programming
  • Mathematical Analysis
  • Mathematical Programming
  • New York
  • Operations Research
  • Optimization
  • Simplex Method
  • South Carolina
  • Statistical Analysis
  • United States

Fields of Study

  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.
  • Systems Analysis and Design