Regularity Conditions for Concave Programming in Finite Dimensional Spaces.

Abstract

Constrained maximum problems with finitely many variables and finitely many constraints are examined with the assumption that the objective and the constraint functions are concave but not necessarily differentiable. A regularity condition necessary and sufficient for a maximum to be attained and for the problems to be reducible to saddle-point problems is presented. Further, a constraint qualification sufficient for the problems to be regular for any concave objective function is presented, of which Slater-Uzawa's constraint qualifications are special cases. (Author)

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1971
Accession Number
AD0725172

Entities

People

  • Hajime Oniki

Organizations

  • Harvard University

Tags

DTIC Thesaurus Topics

  • Computer Programming
  • Computing-Related Activities
  • Economic Systems
  • Economics
  • Efficiency
  • Qualifications

Fields of Study

  • Mathematics

Readers

  • Operations Research

Technology Areas

  • Space
  • Space - Spacecraft Maneuvers