SEMI-INFINITE PROGRAMMING, DIFFERENTIABILITY AND GEOMETRIC PROGRAMMING: PART II

Abstract

The CCK duality theory of semi-infinite programming is specialized to situations involving differentiability (or partial differentiability) of objective and constraint functions to obtain in a uniform and direct manner various results and interpretations, such as generalization of the Kuhn-Tucker Theorem, the 'geometric' programming of Duffin-Peterson, and the Slater constraint qualification example.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1966
Accession Number
AD0635900

Entities

People

  • Abraham Charnes
  • Kenneth O. Kortanek
  • William W. Cooper

Organizations

  • Carnegie Institute of Technology

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Coefficients
  • Computer Programming
  • Contracts
  • Convex Sets
  • Engineering
  • Geometric Programming
  • Industrial Engineering
  • Inequalities
  • Military Research
  • Qualifications
  • Real Numbers
  • Systems Engineering
  • Theorems
  • Universities

Fields of Study

  • Mathematics

Readers

  • Operations Research