Cone Characterizations of Approximate Solutions in Real-Vector Optimization

Abstract

Borrowing concepts from linear algebra and convex analysis, it has been shown how the feasible set for a general vector optimization problem can be mapped under a linear transformation so that Pareto points in the image correspond to nondominated solutions for the original problem. The focus of this paper is to establish corresponding results for approximate nondominated points, based on a new characterization of these solutions using the concept of translated cones. The problem of optimizing over this set of approximate solutions is addressed and possible applications are given in the references.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 2005
Accession Number
ADA462602

Entities

People

  • Alexander Engau
  • Margaret M. Wiecek

Organizations

  • Clemson University

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Algebra
  • Applied Mathematics
  • Convex Programming
  • Evolutionary Algorithms
  • Game Theory
  • Goal Programming
  • Linear Algebra
  • Linear Programming
  • Mathematical Analysis
  • Mathematical Programming
  • Mathematics
  • Multiobjective Optimization
  • Operations Research
  • Optimization
  • Systems Engineering
  • Theorems
  • Vector Spaces

Readers

  • Linear Algebra
  • Systems Analysis and Design