Symmetric duality for Bonvex multiobjective fractional continuous time programming problems

The classical dual in linear programming is symmetric in the sense that the dual of dual is the original linear programming . Such symmetry is not found in duality concepts for nonlinear programming , not even in quadratic programming27. In36 Dorn introduced a different dual for quadratic programming , which is symmetric . Extending these results to general convex programming . Dantzig , Eisenberg and Cottle17 formulated a symmetric dual and established weak and strong duality relations. Symmetric duality results under generalized convexity were given by Mond and Weir in9 for new types of a dual , then in33 Weir and Mond introduced two distinct symmetric duals for mathematical programming under additional assumptions mathematical programming are shown to be self dual. Material Science Research India Vol. 7(2), 413-424 (2010)