Work

Interval method for interval linear program

Year: 2003

Type: article

Abstract: In the problem of interval linear programming (i) max c T x a ≤ Ax ≤ b (i) m−1 . It is known when c ∈R (A T ) that problem (i) has an explicit solution. In this article we formulate the analogous theorem for the second form (ii), and then show the ap- plication of those results on the problem of sensitivity analyses.

Source: University of Zagreb University Computing Centre (SRCE)

Author: Radimir Viher

Language: English

Topic: Optimization and Mathematical Programming

Subfield: Management Science and Operations Research

Field: Decision Sciences

Domain: Social Sciences

Open Access status: green

OpenAlex ID: W2102857183

FWCI:

Cites: 3

Cited by: 1

Related to: 10