Abstract
A multifunction is polyhedral if its graph is the union of finitely many polyhedral convex sets. This paper points out some fairly strong continuity properties that such multifunctions satisfy, and it shows how these may be applied to such areas as linear complementarity and parametric programming.
Sponsored by the United States Army under Contract DAAG29-75-C-0024 and by the National Science Foundation under Grants MCS74-20584 A02 and MCS-7901066.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Gale, The theory of linear economic models (McGraw-Hill, New York, 1960).
A.J. Hoffman, “On approximate solutions of systems of linear inequalities”, Journal of Research of the National Bureau of Standards, Section B, Mathematical Sciences 49 (1952) 263–265.
S.M. Robinson, “An implicit-function theorem for generalized variational inequalities”, Technical summary report 1672, Mathematics Research Center, University of Wisconsin-Madison (1976); National Technical Information Service accession No. AD A031952.
S.M. Robinson, “Generalized equations and their solutions, part I: basic theory”, Mathematical Programming Study 10 (1979) 128–141.
S.M. Robinson, “Strongly regular generalized equations”, Mathematics of Operations Research 5(1980) 43–62.
R.T. Rockafellar, Convex analysis (Princeton University Press, Princeton, 1970).
D.W. Walkup and R.J.-B. Wets, “A Lipschitzian characterization of convex polyhedra”, Proceedings of the American Mathematical Society 20 (1969) 167–173.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 The Mathematical Programming Society
About this chapter
Cite this chapter
Robinson, S.M. (1981). Some continuity properties of polyhedral multifunctions. In: König, H., Korte, B., Ritter, K. (eds) Mathematical Programming at Oberwolfach. Mathematical Programming Studies, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120929
Download citation
DOI: https://doi.org/10.1007/BFb0120929
Received:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00805-4
Online ISBN: 978-3-642-00806-1
eBook Packages: Springer Book Archive