The Method for Parametric Linear Programming Problems.

Abstract

The paper gives a method for solving a parametric linear programming problem of a form: minimize c(sup T)x subject to Ax = u, x > or = O, where u is fixed but unknown vector of parameters. The method is described in Section 2. It is based on the Gauss-Jordan and the Fourier-Motzkin elimination methods which are described in Section 1. The general case, i.e., the case where elements of u, c, A are also treated parametrically is considered in Section 3. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1971
Accession Number
AD0723106

Entities

People

  • W. Grabowski

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Computer Programming
  • Computing-Related Activities
  • Convex Programming
  • Elimination
  • Interdisciplinary Science
  • Linear Programming
  • Mathematical Programming
  • Mathematics

Fields of Study

  • Mathematics

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Analytical Mechanics
  • Mathematical Modeling and Probability Theory.