A Note on Optimization Problems with Additively Separable Objective Function and Max-Separable Constraints

Abstract

A class of optimization problems with additively separable optimization objective function and max-separable constraints is considered. The problem is reduced to a problem of a smaller size and then reformulated as a set covering problem.

For solving the set covering method an appropriate method from the literature is recommended.

Keywords

• Optimization
• Problems
• Additively
• Separable
• Objective
• Function
• Max-Separable
• Constraints