Optimal value bounds in nonlinear programming with interval data

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10099314" target="_blank" >RIV/00216208:11320/11:10099314 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1007/s11750-009-0099-y" target="_blank" >http://dx.doi.org/10.1007/s11750-009-0099-y</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s11750-009-0099-y" target="_blank" >10.1007/s11750-009-0099-y</a>

Result language

angličtina

Original language name

Optimal value bounds in nonlinear programming with interval data

Original language description

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. Undersome 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 easyproblems. Subclasses that are considered are convex quadratic programming and posynomial geometric programming.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BB - Applied statistics, operational research

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2011

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

TOP

ISSN

1134-5764

e-ISSN

—

Volume of the periodical

19

Issue of the periodical within the volume

1

Country of publishing house

DE - GERMANY

Number of pages

14

Pages from-to

93-106

UT code for WoS article

000292881800010

EID of the result in the Scopus database

—