Proximate Linear Programming: An Experimental Study of a Modified Simplex Algorithm for Solving Linear Programs with Inexact Data

Abstract

A modified simplex method has been developed for attacking large linear programs with inexact data in the right hand sides. Results from performing a limited series of computational experiments are reported. These results indicate reductions in computer time of 30 to 70 per cent over the ordinary simplex method.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1971
Accession Number
AD0735162

Entities

People

  • Floyd J. Gould

Organizations

  • University of North Carolina at Chapel Hill

Tags

Communities of Interest

  • Air Platforms
  • C4I

DTIC Thesaurus Topics

  • Algorithms
  • Coefficients
  • Computations
  • Computer Programming
  • Computers
  • Efficiency
  • Engineering
  • Geometry
  • Heuristic Methods
  • Linear Programming
  • Military Research
  • North Carolina
  • Observation
  • Operations Research
  • Simplex Method
  • Statistics
  • Systems Analysis

Fields of Study

  • Mathematics
  • Physics

Readers

  • Calculus or Mathematical Analysis
  • Operations Research