Accession Number:

ADA002995

Title:

An Algorithm for Solving Interval Linear Programming Problems

Descriptive Note:

Research rept.

Corporate Author:

TEXAS UNIV AT AUSTIN CENTER FOR CYBERNETIC STUDIES

Report Date:

1974-11-01

Pagination or Media Count:

25.0

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 andor problem chosen appears to be computationally more efficient than that in the Ben-Israel and Robers algorithm.

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE