An Algorithm for Solving Interval Linear Programming Problems

Published Online:https://doi.org/10.1287/opre.25.4.688

This paper presents an algorithm for solving interval linear programming (IP) problems. The algorithm is a finite iterative method. At each iteration it solves a full row rank, (IP) problem with only one additional constraint.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.