| Article ID: | iaor2008484 |
| Country: | Germany |
| Volume: | 68 |
| Issue: | 3 |
| Start Page Number: | 399 |
| End Page Number: | 412 |
| Publication Date: | May 2007 |
| Journal: | Automation and Remote Control |
| Authors: | Sergeev S.I. |
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.