Third Order Symmetric Duality in Multiobjective Programming Problems
摘要
This paper establishes a new paradigm in nonlinear programming problems for a pair of multiobjective third order symmetric duality. Under the conditions of third order boncavity and bonvexity, we establish duality results, including weak duality, strong duality and converse duality theorems, for newly formulated third-order symmetric dual problems. Different examples and counter examples are also provided to justify our results.