Algorithms to solve some problems of concave programming with linear constraints

  • Authors:

  • S. I. Sergeev

  • Affiliations:

  • Moscow State University of Economics, Statistics, and Informatics, Moscow, Russia

  • Venue:
  • Automation and Remote Control
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Consideration was given to the separable problem of concave programming with linear constraints for which two groups of new algorithms relying on a unique theoretical basis were proposed. The first group of (precise) algorithms approximates the optimal value of a functional from below, the second group of (mostly approximate) algorithms, does this from above.