Optimal value bounds in nonlinear programming with interval data

被引：46
作者：
Hladik, Milan [1 ]
机构：
[1] Charles Univ Prague, Fac Math & Phys, Dept Appl Math, Prague 11800, Czech Republic
来源：
TOP | 2011年 / 19卷 / 01期
关键词：
Interval systems; Nonlinear programming; Optimal value range; Interval matrix; Dependence; OPTIMIZATION; COEFFICIENTS; UNCERTAINTY; DUALITY; MODEL;
D O I：
10.1007/s11750-009-0099-y
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
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.
引用
收藏
页码：93 / 106
页数：14
相关论文
共 24 条
  • [1] Alefeld G., 1983, Introduction to Interval Computation
  • [2] Bazaraa M. S., 2006, NONLINEAR PROGRAMMIN
  • [3] Bot RI, 2006, J OPTIMIZ THEORY APP, V129, P33, DOI 10.1007/s10957-006-947-2
  • [4] Chinneck JW, 2000, J OPER RES SOC, V51, P209, DOI 10.2307/254261
  • [5] Dorn W. S., 1960, Quarterly of applied mathematics, V18, P155, DOI [10.1090/qam/112751, DOI 10.1090/QAM/112751]
  • [6] DUALITY THEORY FOR GEOMETRIC PROGRAMMING
    DUFFIN, RJ
    PETERSON, EL
    [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1966, 14 (06) : 1307 - &
  • [7] Fiedler M., 2006, Linear optimization problems with inexact data
  • [8] Gerlach W., 1981, Mathematische Operationsforschung und Statistik, Series Optimization, V12, P41, DOI 10.1080/02331938108842705
  • [9] Hansen E., 2004, Global Optimization Using Interval Analysis
  • [10] HLADIK M, 2007, KAM DIMATIA SERIES
123