Figure 1From: Optimality for \(E\mbox{-}[0,1]\) convex multi-objective programming problems Example 2 of bicriteria \(\pmb{E\mbox{-}[0,1]}\) convex problem. (a) \(f(M)\) is \(R_{\geqq}^{2}\)-nonconvex. (b) The image of \(f(M)\) under \(E\mbox{-}[0,1]\) map is \(R_{\geqq }^{2}\)-convex.Back to article page