This paper presents a Goal Programming (GP) approach to solving multiobjective fractional programming problems (MOFPPs) involving interval coefficients and target intervals. In the proposed approach, interval-valued fractional objectives are converted into the standard fractional objective goals in GP formulation. The fractional goals are then transformed into linear goals within the framework of GP by using the linear transformation approach. In the GP model formulation, the goal achievement function for minimising the lower bounds of the necessary regret intervals of the goal objectives for the defined interval parameter sets from the optimistic point of view is taken into consideration. In the solution process, the mixed 0–1 method is used to overcome the computational complexity arises for non-convex in nature of the formulated model of the problem. Two numerical examples are provided to illustrate the solution approach.
No takes yet. Share an insight, caveat, or question.
Pal et al. (2011) studied this question.