where f is the objective function and the m c i 's are the constraint functions. A point x is feasible if it satisfies all the constraints. The feasible region G is the set of all the feasible points.

This paper presents three algorithms for solving linear programming problems in which some or all of the objective function coefficients are specified in terms of intervals. Which algorithm is ...

The input argument fun refers to an IML module that specifies a function that returns f, a vector of length m for least-squares subroutines or a scalar for other optimization subroutines. The returned ...