Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming

Published Online:https://doi.org/10.1287/opre.21.5.1154
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.