Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming. Soyster, A. L. Operations Research, 21(5):1154–1157, October, 1973.
Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming [link]Paper  doi  bibtex   
@article{soyster_technical_1973,
	title = {Technical {Note}—{Convex} {Programming} with {Set}-{Inclusive} {Constraints} and {Applications} to {Inexact} {Linear} {Programming}},
	volume = {21},
	issn = {0030-364X, 1526-5463},
	url = {http://pubsonline.informs.org/doi/abs/10.1287/opre.21.5.1154},
	doi = {10/d95snj},
	language = {en},
	number = {5},
	urldate = {2022-02-07},
	journal = {Operations Research},
	author = {Soyster, A. L.},
	month = oct,
	year = {1973},
	keywords = {/unread},
	pages = {1154--1157},
}

Downloads: 0