Generalized Convexity and Concavity Properties of the Optimal Value Function in Parametric Nonlinear Programming.

Abstract

This paper considers generalized convexity and concavity properties of the optimal value function f* for the general parametric optimization problem P(e) of the form min x sub f (x,e) s.t. x epsilon R(e). Many results on convexity and concavity characterizations of f* were presented by the authors in a previous paper. Such properties of f* and the solution map S* form an important part of the theoretical basis for sensitivity, stability and parametric analysis in mathematical optimization. The authors give sufficient conditions for several types of generalized convexity and concavity of f*, in terms of respective generalized convexity and concavity assumptions on f and convexity and concavity assumptions on the feasible region point-to-set map R. Specializations of these results to the general parametric inequality-equality constrained nonlinear programming problem and its right-hand-side version are provided. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 11, 1983
Accession Number
ADA138220

Entities

People

  • A. V. Fiacco
  • J. Kyparisis

Organizations

  • George Washington University

Tags

Communities of Interest

  • Weapons Technologies

DTIC Thesaurus Topics

  • Applied Mathematics
  • Computer Programming
  • Convex Sets
  • Engineering
  • Logistics Management
  • Mathematical Programming
  • Mathematics Laboratories
  • Military Research
  • National Security
  • Naval Personnel
  • New York
  • Nonlinear Programming
  • Operations Research
  • Optimization
  • Parametric Analysis
  • Standards
  • Test And Evaluation

Readers

  • Operations Research