Abstract
Consider the following mathematical programming problem with inequality constraints:
where f and g i , i = 1,…, m are real-valued functions defined on a metric space X. Let g(x) = (g 1 (x),…, g m (x)). We consider g as a map defined on X and mapping into ℝm. Denote the problem (1.1.1) as P(f, g).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Rubinov, A., Yang, X. (2003). Introduction. In: Lagrange-type Functions in Constrained Non-Convex Optimization. Applied Optimization, vol 85. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-9172-0_1
Download citation
DOI: https://doi.org/10.1007/978-1-4419-9172-0_1
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4821-4
Online ISBN: 978-1-4419-9172-0
eBook Packages: Springer Book Archive