COMPOUND ASYMPTOTIC DUALITY CLASSIFICATION SCHEMES.

Abstract

Duality characteristics of two dual linear programming problems over closed convex cones as defined by Ben-Israel - Charnes - Kortanek (BCK) are combined with BCK characteristics of subsidiary linear programs to yield a class of compound classification schemes. While in general a subsidiary problem, called a derivant, may have no relation to the given dual problems, attention is centered on two special cases of derivants, namely positive homogeneous and negative homogeneous. The positive case yields the recent classification of Kallina-Williams, while it is conjectured that the negative case yields a classification of possible states which is an almost purely combinatorial combination of characteristics of the original problems with those of the derivants. (Author)

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1969
Accession Number
AD0697654

Entities

People

  • K. O. Kortanek

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Classification
  • Computer Programming
  • Convex Programming
  • Interdisciplinary Science
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Operations Research
  • Systems Science

Fields of Study

  • Mathematics

Readers

  • Operations Research