<mods:mods version="3.3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd" xmlns:mods="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><mods:titleInfo><mods:title>Constrained Optimization of Discontinuous Systems</mods:title></mods:titleInfo><mods:name type="personal"><mods:namePart type="given">Y.M.</mods:namePart><mods:namePart type="family">Ermoliev</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:name type="personal"><mods:namePart type="given">V.I.</mods:namePart><mods:namePart type="family">Norkin</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:abstract>In this paper we extend the results of Ermoliev, Norkin and Wets [8] and Ermoliev and Norkin [7] to the case of constrained discontinuous optimization problems. In contrast to [7] the attention is concentrated on the proof of general optimality conditions for problems with nonconvex feasible sets. Easily implementable random search technique is proposed.</mods:abstract><mods:originInfo><mods:dateIssued encoding="iso8601">1996-07</mods:dateIssued></mods:originInfo><mods:originInfo><mods:publisher>WP-96-078</mods:publisher></mods:originInfo><mods:genre>Monograph</mods:genre></mods:mods>