Pareto Surfaces of Complexity 1

Abstract

Pareto surfaces and attainable sets of complexity 1 (i.e., those having a 1-commodity representation and no 0-commodity representation) are discussed. An implicit characterization of these sets is given, and various of their properties are derived. In particular, Pareto surfaces of complexity at most 1 are always closed sets.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1973
Accession Number
AD0768282

Entities

People

  • Louis J. Billera
  • Robert E. Bixby

Organizations

  • Cornell University

Tags

DTIC Thesaurus Topics

  • Commerce
  • Continents
  • Continuity
  • Contracts
  • Engineering
  • Game Theory
  • Geographic Regions
  • Mathematics
  • Military Research
  • New York
  • North America
  • Operations Research
  • Security
  • Theorems
  • United States
  • Universities

Readers

  • Computational Modeling and Simulation
  • Economics