Accession Number:

ADA002959

Title:

On a Characterization of Optimality in Convex Programming

Descriptive Note:

Research rept.

Corporate Author:

TEXAS UNIV AT AUSTIN CENTER FOR CYBERNETIC STUDIES

Personal Author(s):

Report Date:

1974-10-01

Pagination or Media Count:

18.0

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.

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE