STABILITY OF THE DUAL CUTTING-PLANE ALGORITHM FOR CONCAVE PROGRAMMING,

Abstract

It is shown how to modify the dual cutting-plane algorithm to handle situations where the Lagrangean cannot be maximized (exactly) in a finite number of steps. A geometrical interpretation is presented. (Author)

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1970
Accession Number
AD0702428

Entities

People

  • B. L. Fox

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Computing-Related Activities
  • Mathematics

Fields of Study

  • Mathematics

Readers

  • Operations Research