Skip to main content
Log in

Characterization of the feasible set mapping in one class of semi-infinite optimization problems

  • Published:
Top Aims and scope Submit manuscript

Abstract

We analyze the behavior of the feasible set in one class of semi-infinite optimization problems, inspired of an approximation of a given function, by means of functions belonging to a Haar space. We present a necessary and sufficient condition for the unicity of the approximation function from the Haar space. Continuity properties of the feasible set mapping have been investigated, as well.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Brosowski B. (1984). Parametric Semi-Infinite Linear Programming I. Continuity of the Feasible Set and of the Optimal Value.Mathematical Programming Study 21, 18–42.

    Google Scholar 

  • Cánovas M.J., López M.A., Parra J. and Toledo F.J. (2003). Distance to Ill-Posedness and Consistency Value of Linear Semi-Infinite Inequality Systems. Operations Research Center, Miguel Hernandez University of Elche, preprint.

  • Cheney E.W. (1966).Introduction to Approximation Theory. McGraw-Hill, 72–79.

  • De Vore R.A. and Lorentz G.G. (1991).Constructive Approximation, Grundlehren der mathematischen Wissenschaften, 303. Springer Verlag, 67–71.

  • Fischer T. (1983). Contributions to Semi-Infinite Linear Optimization. In: B. Brosowski and E. Martensen (eds.),Approximation and Optimization in Mathematical Physics. Peter Lang, 175–199.

  • Goberna M.A., López M.A. and Todorov M. (1996). Stability Theory for Linear Inequality Systems.SIAM Journal On Matrix Analysis and Applications 17 730–743.

    Article  Google Scholar 

  • Goberna M.A., López M.A. and Todorov M. (1997). Stability Theory for Linear Inequality Systems II: Upper Semicontinuity of the Solution Set Mapping.SIAM Journal on Optimization 7, 1138–1151.

    Article  Google Scholar 

  • Guerra F. and Jiménez M.A. (1997). A Semi-Infinite Programming Approach to a Mixed Approximation Problem. In: Guddat J., Jongen H.Th., Nozicka F., Still F. and Twilt F. (eds),Parametric Optimization and Related Topics IV, series Approximation and Optimization. Peter Lang, 135–143.

  • Guerra F. and Jiménez M.A. (1998). On Feasible Sets Defined through Chebyshev Approximation.Mathematical Methods of Operations Research 47, 255–264.

    Article  Google Scholar 

  • Jiménez M.A., Juárez E.L. and Guerra F. (2002). Transformation of Some Mixed Approximation Problems by Optimization Methods.Optimization 51, 1–2.

    Article  Google Scholar 

  • Kuratowski K. (1966).Topology. Academy Press.

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was partially supported by CONACyT of Mexico.

The authors would like to thank to the anonymous referees for their valuable help improving this manuscript

On leave from IMI-BAS, Sofoa, Bulgaria.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Juárez, E.L., Todorov, M.I. Characterization of the feasible set mapping in one class of semi-infinite optimization problems. Top 12, 135–147 (2004). https://doi.org/10.1007/BF02578928

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02578928

Key Words

AMS subject classification

Navigation