Characterization of Optimality in Convex Programming Without a Constraint Qualification.

Abstract

Necessary and sufficient conditions of optimality are given, for convex programming problems, with no constraint qualification. The optimality conditions are stated in terms of consistency or inconsistency of a family of systems of linear inequalities and cone relations.

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1974
Accession Number
ADA005903

Entities

People

  • Adi Ben-israel
  • Aharon Ben-tal
  • S. Zlobec

Organizations

  • University of Texas at Austin

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • Computer Programming
  • Consistency
  • Convex Programming
  • Cooperation
  • Families (Human)
  • Inequalities
  • Mathematics
  • Operations Research
  • Qualifications

Readers

  • Operations Research