ON SOLVING BI-CRITERION MATHEMATICAL PROGRAMS

Abstract

It is shown that bi-criterion mathematical programs can be solved numerically by using parametric programming algorithms. Six algorithms are presented to illustrate the efficiency of the approach.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1965
Accession Number
AD0629519

Entities

People

  • Arthur M. Geoffrion

Organizations

  • University of California, Los Angeles

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Classification
  • Computer Programming
  • Contractors
  • Contracts
  • Convex Sets
  • Discontinuities
  • Evolutionary Algorithms
  • Indicators
  • Linear Programming
  • Mathematical Programming
  • Operations Research
  • Parametric Programming
  • Quadratic Programming
  • Security
  • Simplex Method

Fields of Study

  • Mathematics