| Article ID: | iaor19921489 |
| Country: | United Kingdom |
| Volume: | 28 |
| Start Page Number: | 20 |
| End Page Number: | 25 |
| Publication Date: | Dec 1988 |
| Journal: | USSR Computational Mathematics and Mathematical Physics |
| Authors: | Tuy H., Utkin S.L. |
Improvements in conical algorithms for solving the general concave programming problem are discussed. A new more efficient class of exhaustive procedures for division of the cones is described. It is shown that conical algorithms can be used to solve problems when supplementary ‘concave’ constraints are present and when minimizing the difference between two convex functions.