AN APPROACH TO STRICTLY CONCAVE PROGRAMMING WITH LINEAR CONSTRAINTS

Abstract

A finitely convergent procedure is given for maximizing a differentiable and strictly concave function subject to linear constraints. It is also assumed that the objective function attains its unconstrained maximum. No additional assumptions whatever are required. The procedure is aimed directly at constructing a solution of a certain version of the Kuhn-Tucker Conditions. Provision is made for utilizing a priori information regarding which constraints are likely to be satisfied exactly at the optimum. When applied to quadratic programming, the procedure specializes to a promising generalization of Theil and van de Panne's algorithm.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1965
Accession Number
AD0619768

Entities

People

  • Arthur M. Geoffrion

Organizations

  • University of California, Los Angeles

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Convex Sets
  • Deficiencies
  • Demographic Cohorts
  • Equations
  • Identities
  • Linear Programming
  • Markov Processes
  • Military Research
  • Numbers
  • Numerical Analysis
  • Probability
  • Quadratic Programming
  • Real Numbers
  • Sequences
  • Theorems

Readers

  • Operations Research