(1) Information Sciences Department, RAND Corporation, Santa Monica, CA, USA;(2) Department of System Science, School of Engineering and Applied Science, University of California, Los Angeles, USA
Abstract:
Reverse convex programs generally have disconnected feasible regions. Basic solutions are defined and properties of the latter and of the convex hull of the feasible region are derived. Solution procedures are discussed and a cutting plane algorithm is developed.Research supported by NSF Grant ENG76-12250