Minimizing increasing convex along rays functions based on abstract convexity

In this paper, a problem whose cost function and constraints are increasing convex along rays is considered. For solving such problems, an algorithm is presented that is inspired by the generalized Cutting Angle Method. A set that contains the optimal solution of the mentioned problem is defined. Some numerical examples are presented to confirm the validity and accuracy of the algorithm.