Local Structure of Feasible Sets in Nonlinear Programming - Part II. Nondegeneracy

Robinson SM (1983). Local Structure of Feasible Sets in Nonlinear Programming - Part II. Nondegeneracy. IIASA Collaborative Paper. IIASA, Laxenburg, Austria: CP-83-052

[img]
Preview
Text
CP-83-052.pdf

Download (661kB) | Preview

Abstract

In this paper we examine the local structure of the feasible set of a nonlinear programming problem under the condition of nondegeneracy. We introduce this condition, examine its relationships to known properties of optimization problems, and show that when it holds at a given point the portion of the feasible set near that point is diffeomorphic to a simple convex set (often polyhedral). Moreover, this diffeomorphic relation is stable under small changes in the problem functions.

Item Type: Monograph (IIASA Collaborative Paper)
Research Programs: System and Decision Sciences - Core (SDS)
Depositing User: IIASA Import
Date Deposited: 15 Jan 2016 01:53
Last Modified: 08 Aug 2016 12:21
URI: http://pure.iiasa.ac.at/2330

Actions (login required)

View Item View Item

International Institute for Applied Systems Analysis (IIASA)
Schlossplatz 1, A-2361 Laxenburg, Austria
Phone: (+43 2236) 807 0 Fax:(+43 2236) 71 313