Convex Transformable Programming Problems and Invexity
Morgan A Hanson, B. Mond · Journal of Information and Optimization Sciences · 1987
G. Heal has considered some properties of nonconvex porgramming problems which can be transformed into convex programming problems. In this paper we show that programming problems which can be transformed in such a way are a strict subset of invex programming problems. This has practical computational significance.