Conical algorithms for solving a concave programming problem and some generalizations

Conical algorithms for solving a concave programming problem and some generalizations

0.00 Avg rating0 Votes
Article ID: iaor1990686
Country: United Kingdom
Volume: 28
Start Page Number: 1
End Page Number: 7
Publication Date: Mar 1988
Journal: USSR Computational Mathematics and Mathematical Physics
Authors: , ,
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.