This research proposes a Preemptive Possibilistic Linear Programming (PPLP) approach for solving multiobjective Aggregate Production Planning (APP) problem with interval demand and imprecise unit price and related operating costs. The proposed approach attempts to maximize profit and minimize changes of workforce. It transforms the total profit objective that has imprecise information to three ...

Wind-hydrothermal power system dispatching has received intensive attention in recent years because it can help develop various reasonable plans to schedule the power generation efficiency. But future data such as wind power output and power load would not be accurately predicted and the nonlinear nature involved in the complex multiobjective scheduling model; therefore, to achieve accurate sol...

This paper presents an interval valued goal programming approach for solving multiobjective fractional programming problems. In the model formulation of the problem, the interval-valued system constraints are converted in to equivalent crisp system. The interval valued fractional objective goals are transformed into linear goals by employing the iterative parametric method which is an extension...

The linear multiobjective transportation problem is a special type of vector minimum problem in which constraints are all equality type and the objectives are conicting in nature. This paper presents an application of fuzzy goal programming to the linear multiobjective transportation problem. In this paper, we use a special type of nonlinear (hyperbolic and exponential) membership functions to ...

In this study, a novel algorithm is developed to solve the multi-level multiobjective fractional programming problems, using idea of neutrosophic fuzzy set. The co-efficients in each objective functions assumed be rough intervals. Furthermore, are transformed into two sub-problems based on lower and upper approximation marginal evaluation pre-determined goals for all at level achieved by differ...

‎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...