Optimal value bounds in nonlinear programming with interval data

• Milan Hladík ^[1]
  1. [1] Charles University in Prague

     Charles University in Prague

     Chequia

     
• Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 19, Nº. 1, 2011, págs. 93-106
• Idioma: inglés
• Enlaces
  • Texto completo (pdf)
• Resumen

  • We consider nonlinear programming problems the input data of which are not fixed, but vary in some real compact intervals. The aim of this paper is to determine bounds of the optimal values. We propose a general framework for solving such problems. Under some assumption, the exact lower and upper bounds are computable by using two non-interval optimization problems. While these two optimization problems are hard to solve in general, we show that for some particular subclasses they can be reduced to easy problems. Subclasses that are considered are convex quadratic programming and posynomial geometric programming