Nonlinear Programming Problems with Interval Data

Milan Hladík
Additional contact information
Milan Hladík: Charles University

Chapter Chapter 14 in Interval Linear Programming and Extensions, 2025, pp 403-453 from Springer

Abstract: Abstract This chapter is devoted to nonlinear programming problems with interval entries. Primarily, we will focus on the problem of computing the range of all optimal values. First, we present a general framework to compute the best and worst-case optimal values. Then, we apply it to particular types of nonlinear programming problems, including convex quadratic programming, posynomial geometric programming, linear fractional programming, linear bilevel programming, and the linear complementarity problem. Note that for such special classes we usually can derive stronger results by deep analysis than by applying a general tool.

Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-031-85096-7_14

Ordering information: This item can be ordered from
http://www.springer.com/9783031850967

DOI: 10.1007/978-3-031-85096-7_14

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().