Symmetric Duality in Multiobjective Programming

Symmetric duality in multiobjective programming is a theoretical framework that constructs a dual problem mirroring the structure of a primal multiobjective optimisation task. Unlike classical dual formulations that pair each objective with distinct Lagrange-type multipliers, symmetric duality establishes a balanced correspondence between primal decision variables and dual parameters, often yielding self-duality under specialised conditions. This approach enriches the understanding of Pareto efficiency by providing complementary perspectives on feasibility, optimality and sensitivity analysis. Key concepts include weak duality, which guarantees that any feasible dual solution provides a bound on the primal objectives, and strong duality, which ensures equivalence of objective values under suitable convexity or generalised convexity assumptions. Recent advances have extended symmetric duality beyond differentiable convex programmes to encompass pseudoconvex, preinvex and higher-order structures, revealing deeper interrelations between geometric properties of the feasible region and the existence of efficient solutions. These developments bear practical significance in engineering design, economics and resource allocation, where multi-criterion decisions must balance competing goals. By offering unified dual models, symmetric duality supports robust algorithmic schemes and enhances numerical stability in large-scale applications. It also fosters cross-disciplinary links between mathematical programming, variational analysis and optimisation under uncertainty, paving the way for novel dual-based decomposition methods and sensitivity-driven heuristics. As the field matures, there is growing interest in fractional, nondifferentiable and cone-constrained variants, reflecting the diverse nature of real-world decision problems and the need for flexible yet rigorous dual formulations.

Research from Nature Portfolio

No recent Nature Portfolio content available.

Research from all publishers

A study on cone-preinvexity functions formulates second-order symmetric dual models for nonlinear multiobjective problems, demonstrating weak, strong and strict converse duality under generalised preinvexity assumptions. Numerical examples validate the theoretical bounds between primal and dual programmes, highlighting improved solution accuracy for non-convex objectives.

Another work introduces higher-order type-I functions in multiobjective nonlinear programming, defining six novel duality models that extend classical weak and strong duality theorems. The integration of sublinear functional techniques allows for rigorous treatment of pseudo-convexity, broadening the class of problems that admit symmetric dual solutions.

A third contribution develops a generalised second-order fractional symmetric duality framework based on G-Wolfe-type models. Under pseudobonvexity and fractional objective structures, the authors derive new duality relations that unify several known results. The approach offers enhanced flexibility for fractional programmes encountered in economics and engineering design.

Symmetric Duality in Multiobjective Programming publication trend

The graph below shows the total number of articles in symmetric duality in multiobjective programming across all publications each year (not limited to Nature Index journals).

Technical terms

Multiobjective programming: Optimisation involving two or more conflicting objectives to be balanced simultaneously.

Symmetric duality: A dual formulation that mirrors the primal problem’s structure, often yielding self-duality.

Cone-preinvexity: A generalised convexity notion extending preinvexity over ordered vector spaces defined by cones.

Pseudo-convexity: A relaxation of convexity where every stationary point is a global minimiser.

Wolfe-type model: A dual framework characterised by constraint qualifications and complementary slackness in nonlinear programming.

Duality theorem: A result establishing relationships—such as weak or strong equality—between primal and dual objective values.

References

1. Second-Order Symmetric Duality for Multiple Objectives Nonlinear Programming Under Generalizations of Cone-Preinvexity Functions. Journal of Scientific Computing (2023).
2. Generalizations of Higher-Order Duality for Multiple Objective Nonlinear Programming under the Generalizations of Type-I Functions. Mathematics (2023).
3. Generalized Second-Order G-Wolfe Type Fractional Symmetric Program and their Duality Relations under Generalized Assumptions. International Journal of Mathematical Engineering and Management Sciences (2023).