Abstract—In this paper, a new mixed type higher-order symmetric duality in scalar programming over cone is formulated. The weak, strong and converse duality theorems are proved for these programs under -invexity/ -pseudoinvexity assumptions. Self duality also discussed. As a special case of our duality relation, we give some known duality results. Our results generalize these existing dual formulations.
Index Terms—Higher-order symmetric duality, duality theorems, higher-order invexity/generalized invexity.
Khushboo Verma and Pankaj Mathur are with the Department of Mathematics and Astronomy, University of Lucknow, Lucknow-226001, India (e-mail: 1986khushi@gmail.com, pankaj_mathur14@yahoo.co.in).
T. R. Gulati is with the Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee-247 667, India (e-mail: trgulati@gmail.com).
[PDF]
Cite: Khushboo Verma, Pankaj Mathur, and T. R. Gulati, "Mixed Type Higher Order Symmetric Duality Over Cones," International Journal of Modeling and Optimization vol. 7, no. 2, pp. 78-84, 2017.
