An Algorithm for Solving Interval Linear Programming Problems

Abstract

This paper presents an algorithm for solving interval linear programming problems. The algorithm is a finite iterative method, which in each iteration solves a full row rank interval linear programming problem, with only one additional constraint. The solution and/or problem chosen appears to be computationally more efficient than that in the Ben-Israel and Robers algorithm.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1974
Accession Number
ADA002995

Entities

People

  • Abraham Charnes
  • Francis R. Phillips
  • Frieda Granot

Organizations

  • University of Texas at Austin

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Coefficients
  • Commerce
  • Computer Programming
  • Contracts
  • Heuristic Methods
  • Intervals
  • Iterations
  • Linear Programming
  • Military Research
  • Simplex Method
  • United States
  • United States Government
  • Universities
  • Vector Spaces

Fields of Study

  • Mathematics

Readers

  • Operations Research