Author = Ghafari, Nemat
Number of Articles: 1
Minimizing increasing convex along rays functions based on abstract convexity
Volume 9, Issue 1, 2022, Pages 15-29
https://doi.org/10.22072/wala.2021.529594.1326
Nemat Ghafari
Abstract 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.