This note gives conditions for an explicit (noniterative) representation of the set of optimal solutions of interval programming problems: maximize {(c, x): a ≦ Ax ≦ b} and standard programming problems: maximize {(c, x): Ax = b, 0 ≦ x ≦ u}.
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.