Cone Quasi-Concave Multi-Objective Programming Theory and Dominance Cone Constructions.

Abstract

Some basic theory of cone quasi-concave multi-objective programming is developed. This new class of vector extremal problems with quasi-concave multiple objective employs ideas of nondominated solutions associated with dominance cones. Necessary as well as sufficient conditions for optimal solutions to such problems are provided. A simple example illustrates the concepts involved. In addition, for general applications in economics, it is shown how to establish dominance cones to realize producer priorities, consumer preferences, and other concerns exogenously determined. Keywords: Mathematical programming, Generalized cone concavity; Vector extremal problems; Multi objective programming, nondominated solutions. (jhd)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1988
Accession Number
ADA207538

Entities

People

  • Abraham Charnes
  • D. B. Sun
  • J. J. Rousseau
  • Q. L. Wei
  • Z. M. Huang

Organizations

  • University of Texas at Austin

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Applied Mathematics
  • Business Administration
  • Computer Programming
  • Construction
  • Contracts
  • Convex Sets
  • Economics
  • Game Theory
  • Goal Programming
  • Interdisciplinary Science
  • Mathematical Analysis
  • Mathematical Programming
  • Mathematics
  • Multiobjective Optimization
  • Security
  • Sequences
  • Theorems

Readers

  • Operations Research