A Neurodynamic Approach for Solving E-Convex Interval-Valued Programming

The E-convexity is a generalization of convexity and a special instance of invexity. In this research, we investigate the E-convex interval-valued programming with equality and inequality constraints. By considering the properties of E-convexity as well as utilizing the nonlinear scalarization method and projection theorem, we establish a neurodynamic framework to address this type of problem. Some numerical simulation results are conducted for the purpose of demonstrating the validity of the approach. Besides, we explore the influence of different hyperparameters on the obtained results.