Higher-Order Duality for Multiobjective Programming Involving (teta, ro)-Univexity

The concepts of (teta, ro)-invexity have been given by Caristi, Ferrara and Stefanescu [1]. We consider a higher-order dual model associated to a multiobjective programming problem involving support functions and a weak duality result is established under appropriate higher-order (teta, ro)-univexity conditions.