Accession Number:

AD0677101

Title:

A DECOMPOSITION METHOD FOR INTERVAL LINEAR PROGRAMMING

Descriptive Note:

Systems research memo.

Corporate Author:

NORTHWESTERN UNIV EVANSTON IL TECHNOLOGICAL INST

Personal Author(s):

Report Date:

1968-08-01

Pagination or Media Count:

25.0

Abstract:

An interval linear program is IP maximize c superscript tx, subject to b- or Ax or b where the matrix A, vectors b-, b, and c are given. If A has full row rank, the optimal solutions of IP can be written explicitly A. Ben-Israel and A. Charnes An explicit solution of a special class of linear programming, Operations Research, forthcoming. This result is used in conjunction with the Dantzig-Wolfe decomposition principle to develop a finite iterative technique specially suited for solving the general IP. Since any bounded linear program may be cast in form IP the technique may also be considered as an alternate method for linear programming.

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE