‎In this paper‎, ‎we propose an algorithm to obtain an approximation set of the (weakly) nondominated points of nonsmooth multiobjective optimization problems with equality and inequality constraints‎. ‎We use an extension of the Wolfe duality to construct the separating hyperplane in Benson's outer algorithm for multiobjective programming problems with subdifferentiable functions‎. ‎We also fo...

⎯ The aim of the present work is to characterize weakly efficient solution of multiobjective programming problems under the assumptions of α-invexity, using the concepts of critical point and Kuhn-Tucker stationary point for multiobjective programming problems. In this paper, we also extend the above results to the nondifferentiable multiobjective programming problems. The use of α-invex functi...

‎In this article‎, ‎we formulate two dual models Wolfe and Mond-Weir related to symmetric nondifferentiable multiobjective programming problems‎. ‎Furthermore‎, ‎weak‎, ‎strong and converse duality results are established under $K$-$G_f$-invexity assumptions‎. ‎Nontrivial examples have also been depicted to illustrate the theorems obtained in the paper‎. ‎Results established in this paper unify...

Abstract In the real world, we often encounter cases where the information / data items can’t be determined with certainty. Hence the value of the datum in the data is assessed using an interval. Meanwhile multiobjective linear programming model is more adequate to describe the problem in the real world. Thus, the multiobjective linear programming problem will be developed into a multiobjective...

In this paper the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality cond...

This paper addresses the problem of finding an approximation to the minimal element set of the objective space for the class of multiobjective deterministic finite horizon optimal control problems. The objective space is assumed to be partially ordered by a pointed convex cone containing the origin. The approximation procedure consists of a two-step discretization in time and state space. Follo...