Non-differentiable higher-order symmetric duality in mathematical programming with generalized invexity

A pair of non-differentiable higher-order symmetric dual model in mathematical programming is formulated. The weak and strong duality theorems are established under higher-order-invexity assumption. Symmetric minimax mixed integer primal and dual problems are also investigated.