The Structure of Admissible Points with Respect to Cone Dominance,

Abstract

The set of admissible (pareto-optimal) points of a closed convex set X is studied when preferences are described by a convex, but not necessarily closed, cone. Assuming that the preference cone is strictly supported and making mild assumptions about the recession directions of X, a representation theorem of Arrow, Barankin and Blackwell is extending by showing that all admissible points are either limit points of certain strictly admissible alternatives or translations of such limit points by rays in the closure of the preference cone, and show that the set of strictly admissible points is connected, as is the full set of admissible points. Relaxing the convexity assumption imposed upon X, local properties of admissible points are considered in terms of Kuhn-Tucker type characterizations. Necessary and sufficient conditions are specified for an element of X to be a Kuhn-Tucker point, conditions which, in addition, provide local characterizations of strictly admissible points.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1977
Accession Number
ADA051540

Entities

People

  • G. R. Bitran
  • T. L. Magnanti

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Air Platforms
  • Human Systems

DTIC Thesaurus Topics

  • Convex Sets
  • Economics
  • Evolutionary Algorithms
  • Linear Programming
  • Mathematical Analysis
  • Mathematical Programming
  • Mathematics
  • Military Research
  • New York
  • Nonlinear Programming
  • Operations Research
  • Optimization
  • Security
  • Simplex Method
  • Systems Engineering
  • Theorems
  • Translations

Fields of Study

  • Economics

Readers

  • Graph Algorithms and Convex Optimization.
  • Mathematical Modeling and Probability Theory.
  • Operations Research