Skip to main content
SpringerLink
Log in

A Branch-and-Bound Approach for Solving a Class of Generalized Semi-infinite Programming Problems

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

A nonconvex generalized semi-infinite programming problem is considered, involving parametric max-functions in both the objective and the constraints. For a fixed vector of parameters, the values of these parametric max-functions are given as optimal values of convex quadratic programming problems. Assuming that for each parameter the parametric quadratic problems satisfy the strong duality relation, conditions are described ensuring the uniform boundedness of the optimal sets of the dual problems w.r.t. the parameter. Finally a branch-and-bound approach is suggested transforming the problem of finding an approximate global minimum of the original nonconvex optimization problem into the solution of a finite number of convex problems.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Germeyer, Y. B. (1976a), Einführung in die Theorie des Operations Research, Akademie Verlag, Berlin.

    Google Scholar 

  • Germeyer, Y. B. (1976b), Games with Non-antagonistic Interests (in Russian), Nauka, Moscow.

    Google Scholar 

  • Graettinger, T. J. and Krogh, B. H. (1988), The acceleration radius: A global performance measure for robotic manipulators, IEEE J. of Robotics and Automation 4: 60–69.

    Google Scholar 

  • Hettich, R., Jongen, H. Th. and Stein, O. (1995), On continuous deformations of semi-infinite optimization problems, in M. Florenzano, J. Guddat, M. Jimenez, H. Th. Jongen, G. Lopez Lagomasino and F. Marcellan (eds.), Approximation and Optimization in the Caribbean II, Peter Lang Verlag, Frankfurt a. M., pp. 406–424.

  • Hettich, R. and Kortanek, K. O. (1993), Semi-infinite programming: Theory, methods and applications, SIAM Review 35: 380–429.

    Google Scholar 

  • Hettich, R. and Still, G. (1991), Semi-infinite programming models in robotics, in J. Guddat, H. Th. Jongen, B. Kummer and F. Nozicka (eds.), Parametric Optimization and Related Topics II, Akademie Verlag, Berlin, pp. 112–118.

    Google Scholar 

  • Hettich, R. and Still, G. (1995), Second-order optimality conditions for generalized semi-infinite programming problems, Optimization 34: 195–211.

    Google Scholar 

  • Horst, R. and Tuy, H. (1996), Global Optimization, Springer Verlag, Berlin-Heidelberg-New York.

    Google Scholar 

  • Jongen, H. T., Rückmann, J.-J. and Stein, O. (1998), Generalized semi-infinite optimization: A firstorder optimality condition and examples, to appear in Mathematical Programming.

  • Kaplan, A. and Tichatschke, R. (1996), On a class of terminal variational problems, in J. Guddat, H. Th. Jongen, F. Nozicka, G. Still and F. Twilt (eds.), Parametric Optimization and Related Topics IV, Verlag Peter Lang, Frankfurt/M., pp. 185–199.

    Google Scholar 

  • Kaplan, A. and Tichatschke, R. (1997), On the numerical treatment of a class of semi-infinite terminal problems, Optimization 41: 1–36.

    Google Scholar 

  • Künzi, H. P. and Krelle, W. (1962), Nichtlineare Programmierung, Springer Verlag, Berlin.

    Google Scholar 

  • Levitin, E. S. (1997), On the reduction of generalized non-convex semi-infinite mathematical programming problems to convex problems of semi-infinite programming, Automation and Remote Control.

  • Levitin, E. S. and Khranovich, I. L. (1996), Global minimum search in non-convex programming problems with biseparable superpositions of convex functions, Russian Math. Dokl. v. 350(2): 166–169.

    Google Scholar 

  • Levitin, E. S. and Tichatschke, R. (1998), On smoothing of parametric minimax-functions and generalized max-functions via regularization, to appear in Journal on Convex Analysis.

  • Polyak, B. T. (1987), Introduction to Optimization, Optimization Software Inc. Publ. Division, New York.

    Google Scholar 

  • Pshenichny, B. N. (1980), Convex Analysis and Extremal Problems (in Russian), Nauka, Moscow.

    Google Scholar 

  • Rockafellar, R. T. (1970), Convex Analysis, Princeton University Press, Princeton.

    Google Scholar 

  • Tichatschke, R., Hettich, R. and Still G. (1989), Connections between generalized, inexact and semiinfinite linear programming, ZOR – Methods and Models of Operations Research 33: 367–382.

    Google Scholar 

  • Weber, G. (1996), Generalized semi-infinite optimization: On some foundations, Preprint, Nr. 1825, Technische Hochschule Darmstadt, Fachbereich Mathematik.

Download references

Author information

Authors and Affiliations

  1. Institute of System Analysis, Russian Academy of Science, 117312, Moscow, Russia

    E. Levitin

  2. Department of Mathematics, University of Trier, 54286, Trier, Germany (e-mail: Email

    R. Tichatschke

Authors
  1. E. Levitin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Tichatschke
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Levitin, E., Tichatschke, R. A Branch-and-Bound Approach for Solving a Class of Generalized Semi-infinite Programming Problems. Journal of Global Optimization 13, 299–315 (1998). https://doi.org/10.1023/A:1008245113420

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008245113420

Search

Navigation