Duality Theory In Multiobjective Differentiable Programming
Bhupendra Kumar Singh · Journal of Information and Optimization Sciences · 1988
In this paper, a Mond-Weir type dual is considered for a multiobjective n n-linear programming problem with inequality and equality constraints. Both the primal and the dual have the same objective function. Weak and strong duality theorems are established along the lines of classical nonlinear programming. This is done under various (relaxed) convexity restrictions on the linear combinations of the components of maps describing the constraints and the objective function. Some of the strong duality results are based on necessary conditions for a vector to be a Pareto minimal. These necessary conditions are based on the idea of a convergence vector, a constraint qualification and a theorem of the alternative.