On a Characterization of Optimality in Convex Programming

Abstract

Necessary and sufficient conditions for optimality are given, for convex programming problems, without constraint qualification, in terms of a single mathematical program, which can be chosen to be bilinear.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1974
Accession Number
ADA002959

Entities

People

  • A. Ben-israel
  • A. Ben-tal

Organizations

  • University of Texas at Austin

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Computer Programming
  • Convex Programming
  • Cooperation
  • Mathematics
  • Qualifications