Higher Order Convexity and Duality in Multiobjective Programming Problems

Author(s):  
J. Zhang
Filomat ◽  
2019 ◽  
Vol 33 (6) ◽  
pp. 1619-1639
Author(s):  
Tadeusz Antczak ◽  
Hachem Slimani

In this paper, a nonconvex nonsmooth multiobjective programming problem is considered and two its higher-order duals are defined. Further, several duality results are established between the considered nonsmooth vector optimization problem and its dual models under assumptions that the involved functions are higher-order (??)-type I functions.


Author(s):  
Jia-Ding Cao ◽  
Heinz H. Gonska

AbstractDeVore-Gopengauz-type operators have attracted some interest over the recent years. Here we investigate their relationship to shape preservation. We construct certain positive convolution-type operators Hn, s, j which leave the cones of j-convex functions invariant and give Timan-type inequalities for these. We also consider Boolean sum modifications of the operators Hn, s, j show that they basically have the same shape preservation behavior while interpolating at the endpoints of [−1, 1], and also satisfy Telyakovskiῐ- and DeVore-Gopengauz-type inequalities involving the first and second order moduli of continuity, respectively. Our results thus generalize related results by Lorentz and Zeller, Shvedov, Beatson, DeVore, Yu and Leviatan.


Sign in / Sign up

Export Citation Format

Share Document