Asymptotic Linear Programming.

Abstract

By suitably modifying the Simplex Algorithm, the author shows how to obtain a parametric closed form for the solution to linear programs, all of whose coefficients may be as complex as rational functions of a real parameter t, in two primary circumstances. (Modified author abstract)

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1972
Accession Number
AD0761068

Entities

People

  • Robert G. Jeroslow

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Coefficients
  • Computer Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Linear Programming
  • Mathematics
  • Military Research
  • Rational Functions
  • Simplex Method

Fields of Study

  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Operations Research