One class of separable optimization problems: solution method, application

Abstract

A solution method for solving optimization problems with a max-separable objective function and min-separable inequality constraints is suggested. The method is based on the results of 5, 6. Application in some location problems and small illustrative numerical examples are presented.

Keywords:

• non-convex optimization
• location problems
• max-separable optimization problems

Mathematics Subject Classifications::

• 90C26
• 90C30
• 90C90
• 65K05

Acknowledgements

This work was under the support of GA ČR 202-03/2060982, GA ČR # 402/06/1071.