Solving Multi-Objective Linear Programming Problem by Statistical Averaging Method with the Help of Fuzzy Programming Method ()

Samsun Nahar^{1}, Marin Akter^{2}, Md. Abdul Alim^{3}

^{1}Department of Basic Sciences and Humanities, University of Asia Pacific, Dhaka, Bangladesh.

^{2}General Education Department, City University, Dhaka, Bangladesh.

^{3}Department of Mathematics, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh.

**DOI: **10.4236/ajor.2023.132002
PDF
HTML XML
162
Downloads
976
Views
Citations

A multi-objective linear programming problem is made from fuzzy linear programming problem. It is due the fact that it is used fuzzy programming method during the solution. The Multi objective linear programming problem can be converted into the single objective function by various methods as Chandra Sen’s method, weighted sum method, ranking function method, statistical averaging method. In this paper, Chandra Sen’s method and statistical averaging method both are used here for making single objective function from multi-objective function. Two multi-objective programming problems are solved to verify the result. One is numerical example and the other is real life example. Then the problems are solved by ordinary simplex method and fuzzy programming method. It can be seen that fuzzy programming method gives better optimal values than the ordinary simplex method.

Keywords

Fuzzy Programming Method, Fuzzy Linear Programming Problem, Multi-Objective Linear Programming Problem, Statistical Averaging Method, New Statistical Averaging Method

Share and Cite:

Nahar, S. , Akter, M. and Alim, M. (2023) Solving Multi-Objective Linear Programming Problem by Statistical Averaging Method with the Help of Fuzzy Programming Method. *American Journal of Operations Research*, **13**, 19-32. doi: 10.4236/ajor.2023.132002.

1. Introduction

Fuzzy decision-making technique is used repeatedly for fuzzy multi-objective linear programming problem. It has been investigated for more than decades by many researchers. The idea of fuzzy set was first proposed by Zadeh [1].

The idea of fuzzy decision was mentioned by Bellman and Zadeh in 1970. Multi-Objective Linear Programming problems (MOLPP) with fuzzy goals were taken into account by Zimmerman [2]. The most common approach to solve fuzzy linear programming problem is to shift them to similar deterministic linear program. Zimmerman has introduced fuzzy programming approach to solve crisp multi-objective linear programming problem. Fuzzy linear programming problem (FLPP) in fuzzy environment was introduced by Tanaka and Asai [3]. In study there are several methods for solving MOLPP models by applying fuzzy programming approaches. Thakre *et al*. [4] provided a method to solve FLPP where both the coefficient matrix of the constraints and cost coefficient are fuzzy in nature.

First formulation of fuzzy linear programming (FLP) was proposed by Zimmermann. A new fuzzy primal and dual simplex algorithm is for solving FLP by Mahdavi-Amiri *et al*. [5].

Nasseri and Alizadeh [6] proposed a fuzzy Big-M method. Nehi [7] used ranking function to solve fuzzy MOLPP. A method is proposed by Kiruthiga and Loganathan [8] to find crisp MOLPP from FMOLPP by using ranking function.

In this paper, we solve MOLPP by using fuzzy programming method. For making single objective from multi-objective, we apply Chandra Sen’s method and statistical averaging method by Nahar and Alim [9]. It can be seen that when we use fuzzy programming method, we get better result rather than solving ordinary simplex method.

Fuzzy number

Let *X* be a set of objects for fuzzy statement. The set of ordered pairs
$\stackrel{\u02dc}{A}=\left\{\left(x,{\mu}_{A}\left(x\right)\right)|x\in X\right\}$ where
${\mu}_{A}:X\to \left[0,1\right]$ is a fuzzy set in *X*. The evaluation function
${\mu}_{A}\left(x\right)$ is called the membership function.

A fuzzy number *A** *= (*a*, *b*, *c*) is said to be a triangular fuzzy number if its membership function is given by

${\mu}_{A}\left(x\right)=\{\begin{array}{l}\frac{x-a}{b-a},\text{\hspace{0.17em}}\text{\hspace{0.17em}}a\le x\le b\\ 1,\text{\hspace{0.17em}}\text{\hspace{1em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}x=b\\ \frac{x-b}{b-c},\text{\hspace{0.17em}}\text{\hspace{0.17em}}b\le x\le c\end{array}$

Mathematical model of multi-objective linear programming problem:

$\mathrm{max}{Z}_{s}\left(x\right)={\displaystyle \underset{j=1}{\overset{n}{\sum}}{c}_{j}{x}_{j}},s=1,2,\cdots ,s$

Subject to

$\begin{array}{l}{\displaystyle \underset{j=1}{\overset{n}{\sum}}{a}_{ij}{x}_{j}}\left(\le ,=,\ge \right){b}_{i},i=1,2,\cdots ,m\\ {x}_{j}\ge 0,j=1,2,\cdots ,n\end{array}$ (1)

To verify the result, two examples are shown. One is numerical example (Hypothetical) and the other is real life example (An investigation for the risk reduction along the coastal area).

2. Methods

Chandra Sen’s method [10] is very popular method for making single objective LPP from MOLPP. For data analysis statistic and mathematics are related to each other to analyze results. Statistical averaging method is a method using average. For solving optimization problem simplex method is a technique involving single objective function or multi-objective function with some constraints. Fuzzy programming method is an optimization model which is associated with uncertainty. Fuzzy programming method works on the concept of fuzzy logic.

In this paper for making single objective from MOLPP, Chandra Sen’s method and statistical averaging methods are used. Later on, the single objective function is solved by the ordinary simplex method and fuzzy programming method and hence the results are compared.

Fuzzy Programming Method

Step 1: Solve MOLPP by using simplex algorithm, considering only one of the objectives at a time and ignoring all others. Repeat the process *s* times for* s* different objective functions.

Step 2: Using all solutions in step 1, construct a pay off matrix of size *s* by *s*. Then from the pay off matrix estimate the lower bound (*L _{s}*) and the upper bound (

${L}_{s}\le {z}_{s}\le {U}_{s},s=1,2,\cdots ,s$

Step 3: Define a fuzzy linear membership function
$\mu \left({z}_{s}\left(x\right)\right)$ for the *s*^{th} objective function
${z}_{s},s=1,2,\cdots ,s$

$\mu \left({z}_{s}\left(x\right)\right)=\{\begin{array}{l}0,\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.05em}}\text{if}\text{\hspace{0.17em}}{z}_{s}\le {L}_{s}\\ 1-\frac{{U}_{s}-{z}_{s}}{{U}_{s}-{L}_{s}},\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.05em}}\text{if}\text{\hspace{0.17em}}{L}_{s}\le {z}_{s}\le {U}_{s}\\ 1,\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{if}\text{\hspace{0.17em}}{z}_{s}\ge {U}_{s}\end{array}$ (2)

Step 4: Using membership functions we can get a crisp model by introducing an augmented variable $\lambda $

$\mathrm{max}:1-\frac{{U}_{s}-{z}_{s}}{{U}_{s}-{L}_{s}},s=1,2,\cdots ,s$

$\mathrm{min}:\frac{{U}_{s}-{z}_{s}}{{U}_{s}-{L}_{s}};s=1,2,\cdots ,s$

Subject to (1) can be further written as

Minimize $\lambda $

Subject to

$\begin{array}{l}{\displaystyle \underset{j=1}{\overset{n}{\sum}}{c}_{j}{x}_{i}}+\left({U}_{s}-{L}_{s}\right)\lambda \ge {U}_{s},s=1,2,\cdots ,s\\ {\displaystyle \underset{j=1}{\overset{n}{\sum}}{a}_{ij}{x}_{j}}\left(\le ,=,\ge \right){b}_{i},i=1,2,\cdots ,m\\ \lambda \ge 0,\text{\hspace{0.17em}}{x}_{j}\ge 0,j=1,2,\cdots ,n\end{array}$ (3)

Step 5: Solve the crisp model by simplex algorithm and find optimal solution.

3. Numerical Example (Hypothetical)

$\begin{array}{l}\mathrm{max}{z}_{1}=9{x}_{0}+4{x}_{1}+5{x}_{2}\\ \mathrm{max}{z}_{2}=3{x}_{0}+{x}_{1}+5{x}_{2}\\ \mathrm{max}{z}_{3}={x}_{0}+2{x}_{1}+3{x}_{2}\end{array}$ (4)

Subject to

$\begin{array}{l}4{x}_{0}+2{x}_{1}+3{x}_{2}\le 5\\ 5{x}_{0}+3{x}_{1}+2{x}_{2}\le 9\\ 3{x}_{0}+2{x}_{1}+7{x}_{2}\le 7\\ {x}_{0},{x}_{1},{x}_{2}\ge 0\end{array}$ (5)

For the first objective function in Equation (4) with constraints in equation (5), by applying simplex algorithm we get *z*_{1} = 11.25 with (5/4, 0, 0). The value of the objective function is obtained using the steps of simplex method.

Similarly for second objective function in equation (4) with same constraints in equation (5) we get *z*_{2} = 5.63 with (14/19, 0, 13/19).

And for last objective function in Equation (4) with same constraints in equation (5) we get *z*_{3} = 5 with (0, 7/4, 1/2).

A Pay-off matrix is formulated as in “Table 1”.

For the Pay-off matrix, lower and upper bound are established as:

$\begin{array}{l}9.5\le {z}_{1}\le 11.25\\ 3.75\le {z}_{2}\le 5.67\\ 1.25\le {z}_{3}\le 5\end{array}$ (6)

Using Equation (3) we can write as

min $\lambda $

Subject to

$\begin{array}{l}9{x}_{0}+4{x}_{1}+5{x}_{2}+1.75\lambda \ge 11.25\\ 3{x}_{0}+{x}_{1}+5{x}_{2}+1.92\lambda \ge 5.67\\ {x}_{0}+2{x}_{1}+3{x}_{2}+3.75\lambda \ge 5\end{array}$

$\begin{array}{l}4{x}_{0}+2{x}_{1}+3{x}_{2}\le 5\\ 5{x}_{0}+3{x}_{1}+2{x}_{2}\le 9\\ 3{x}_{0}+2{x}_{1}+7{x}_{2}\le 7\\ {x}_{0},{x}_{1},{x}_{2},\lambda \ge 0\end{array}$ (7)

Table 1. Pay off matrix.

Using simplex algorithm, we get the result ${x}_{0}=0.69,{x}_{1}=0.51,{x}_{2}=0.41,\lambda =0.55$ .

Finally, the crisp model is solved to get the result ${\phi}_{1}=10.3,{\phi}_{2}=4.63,{\phi}_{3}=2.94$ .

Thus, for simplex method we get the optimal values for ${z}_{1}=11.25,{z}_{2}=5.63,{z}_{3}=5$ and for fuzzy programming method we get ${\phi}_{1}=10.3,{\phi}_{2}=4.63,{\phi}_{3}=2.94$ .

3.1. Ordinary Simplex Method

For making single objective from multi-objective applying Chandra Sen’s method by Sen

$\begin{array}{c}z=\frac{{z}_{1}}{{\phi}_{1}}+\frac{{z}_{2}}{{\phi}_{2}}+\frac{{z}_{3}}{{\phi}_{3}}\\ =\frac{1}{11.25}\left(9{x}_{0}+4{x}_{1}+5{x}_{2}\right)+\frac{1}{5.63}\left(3{x}_{0}+{x}_{1}+5{x}_{2}\right)+\frac{1}{5}\left({x}_{0}+2{x}_{1}+3{x}_{2}\right)\\ ={x}_{0}\left(0.8+0.53+0.2\right)+{x}_{1}\left(0.35+0.18+0.4\right)+{x}_{2}\left(0.44+0.89+0.6\right)\\ =1.53{x}_{0}+0.93{x}_{1}+1.93{x}_{2}\end{array}$ _{ }

Thus, the single objective becomes

$\mathrm{max}z=1.53{x}_{0}+0.93{x}_{1}+1.93{x}_{2}$ (8)

From the single objective function in Equation (8) with same constraints (5) by using simplex algorithm we get *z** *= 2.5925 with (0, 7/4, 1/2).

For
${\phi}_{1}=11.25,{\phi}_{2}=5.63,{\phi}_{3}=5$ using statistical averaging method such as arithmetic mean (*A*.*M*), geometric mean (*G*.*M*) and harmonic mean (*H*.*M*) we get

$\begin{array}{l}A.M=\frac{11.25+5.63+5}{3}=7.29\\ G.M=\sqrt[3]{11.25\times 5.63\times 5}=6.687\\ H.M=\frac{3}{\frac{1}{11.25}+\frac{1}{5.63}+\frac{1}{5}}=6.42\end{array}$

Applying arithmetic mean formula by Nahar and Alim we can write

$\begin{array}{c}\mathrm{max}z=\frac{1}{A.M}\left({z}_{1}+{z}_{2}+{z}_{3}\right)\\ =\frac{1}{7.29}\left(9{x}_{0}+4{x}_{1}+5{x}_{2}+3{x}_{0}+{x}_{1}+5{x}_{2}+{x}_{0}+2{x}_{1}+3{x}_{2}\right)\\ =\frac{1}{7.29}\left[{x}_{0}\left(9+3+1\right)+{x}_{1}\left(4+1+2\right)+{x}_{2}\left(5+5+3\right)\right]\\ =\frac{1}{7.29}\left(13{x}_{0}+7{x}_{1}+13{x}_{2}\right)\\ =1.783{x}_{0}+0.96{x}_{1}+1.783{x}_{2}\end{array}$

Thus, the single objective becomes

$\mathrm{max}z=1.783{x}_{0}+0.96{x}_{1}+1.783{x}_{2}$ (9)

From the single objective function in Equation (9) with same constraints (5) by using simplex algorithm we get

*z** *= 2.5715 with (0, 7/4, 1/2)

Applying geometric mean formula by Nahar and Alim we can write

$\begin{array}{c}\mathrm{max}z=\frac{1}{G.M}\left({z}_{1}+{z}_{2}+{z}_{3}\right)\\ =\frac{1}{6.687}\left(13{x}_{0}+7{x}_{1}+13{x}_{2}\right)\\ =1.94{x}_{0}+1.05{x}_{1}+1.94{x}_{2}\end{array}$

Thus, the single objective is

$\mathrm{max}z=1.94{x}_{0}+1.05{x}_{1}+1.94{x}_{2}$ (10)

From the single objective function in equation (10) with same constraints (5) by using simplex algorithm we get *z** *= 2.8075 with (0, 7/4, 1/2).

Applying Harmonic mean formula by Nahar and Alim (2017) we can write

$\begin{array}{c}\mathrm{max}z=\frac{1}{H.M}\left({z}_{1}+{z}_{2}+{z}_{3}\right)\\ =\frac{1}{6.42}\left(13{x}_{0}+7{x}_{1}+13{x}_{2}\right)\\ =2.02{x}_{0}+1.09{x}_{1}+2.024{x}_{2}\end{array}$

Thus, the single objective is

$\mathrm{max}z=2.02{x}_{0}+1.09{x}_{1}+2.024{x}_{2}$ (11)

From the single objective function in Equation (11) with same constraints (5) by using simplex algorithm we get *z** *= 2.9175 with (0, 7/4, 1/2).

3.2. Fuzzy Programming Method

Using the value of fuzzy programming method applying Chanda Sen’s method by Sen

$\begin{array}{c}\mathrm{max}z=\frac{{z}_{1}}{{\phi}_{1}}+\frac{{z}_{2}}{{\phi}_{2}}+\frac{{z}_{3}}{{\phi}_{3}}\\ =\frac{{z}_{1}}{10.3}+\frac{{z}_{2}}{4.63}+\frac{{z}_{3}}{2.94}\\ =\frac{1}{10.3}\left(9{x}_{0}+4{x}_{1}+5{x}_{2}\right)+\frac{1}{4.63}\left(3{x}_{0}+{x}_{1}+5{x}_{2}\right)+\frac{1}{2.94}\left({x}_{0}+2{x}_{1}+3{x}_{2}\right)\\ ={x}_{0}\left(0.874+0.65+0.34\right)+{x}_{1}\left(0.38+0.216+0.68\right)+{x}_{2}\left(0.48+1.08+1.02\right)\\ =1.864{x}_{0}+1.276{x}_{1}+2.58{x}_{2}\end{array}$ _{ }

Thus, the single objective is

$\mathrm{max}z=1.864{x}_{0}+1.276{x}_{1}+2.58{x}_{2}$ (12)

From the single objective function in Equation (12) with same constraints (5) by using simplex algorithm we get *z** *= 3.523 with (0, 7/4, 1/2).

For
${\phi}_{1}=10.3,{\phi}_{2}=4.63,{\phi}_{3}=2.94$ using statistical averaging method such as arithmetic mean (*A*.*M*), geometric mean (*G*.*M*) and harmonic mean (*H*.*M*) we get

$\begin{array}{l}A.M=\frac{11.25+5.63+5}{3}=7.29\\ G.M=\sqrt[3]{10.3\times 4.63\times 2.94}=5.11\\ H.M=\frac{3}{\frac{1}{10.3}+\frac{1}{4.63}+\frac{1}{2.94}}=4.594\end{array}$

Applying arithmetic mean formula by Nahar and Alim (2017) we can write

$\begin{array}{c}\mathrm{max}z=\frac{1}{A.M}\left({z}_{1}+{z}_{2}+{z}_{3}\right)\\ =\frac{1}{5.957}\left(9{x}_{0}+4{x}_{1}+5{x}_{2}+3{x}_{0}+{x}_{1}+5{x}_{2}+{x}_{0}+2{x}_{1}+3{x}_{2}\right)\\ =\frac{1}{5.957}\left[{x}_{0}\left(9+3+1\right)+{x}_{1}\left(4+1+2\right)+{x}_{2}\left(5+5+3\right)\right]\\ =\frac{1}{5.957}\left(13{x}_{0}+7{x}_{1}+13{x}_{2}\right)\\ =2.182{x}_{0}+1.175{x}_{1}+2.182{x}_{2}\end{array}$

$\mathrm{max}z=2.182{x}_{0}+1.175{x}_{1}+2.182{x}_{2}$ (13)

From the single objective function in Equation (13) with same constraints (5) by using simplex algorithm we get *z** *= 3.1472 with (0, 7/4, 1/2).

Applying geometric mean formula by Nahar and Alim (2017) we can write

$\begin{array}{c}\mathrm{max}z=\frac{1}{G.M}\left({z}_{1}+{z}_{2}+{z}_{3}\right)\\ =\frac{1}{5.11}\left(13{x}_{0}+7{x}_{1}+13{x}_{2}\right)\\ =2.544{x}_{0}+1.369{x}_{1}+2.544{x}_{2}\end{array}$

Thus, single objective is

$\mathrm{max}z=2.544{x}_{0}+1.369{x}_{1}+2.544{x}_{2}$ (14)

From the single objective function in Equation (14) with same constraints (5) by using simplex algorithm we get *z** *= 3.65 with (0, 7/4, 1/2).

Applying harmonic mean formula by Nahar and Alim (2017) we can write

$\begin{array}{c}\mathrm{max}z=\frac{1}{H.M}\left({z}_{1}+{z}_{2}+{z}_{3}\right)\\ =\frac{1}{4.594}\left(13{x}_{0}+7{x}_{1}+13{x}_{2}\right)\\ =2.83{x}_{0}+1.525{x}_{1}+2.83{x}_{2}\end{array}$

Thus, the single objective is

$\mathrm{max}z=2.83{x}_{0}+1.525{x}_{1}+2.83{x}_{2}$ (15)

From the single objective function in Equation (15) with same constraints (5) by using simplex algorithm we get *z** *= 4.083 with (0, 7/4, 1/2). All these results can be shown in “Table 2”.

“Table 2” can be described as in “Figure 1”.

Table 2. Comparison between Chandra Sen’s method and statistical averaging method in both method ordinary simplex and fuzzy programming method.

Figure 1. Optimal values of MOLPP by using ordinary and fuzzy programming method.

4. Real Life Example

For the real life example, an example is taken from Nahar,* et** **al*. [11] in 2022. In Nahar, et al., a Fuzzy multi-objective linear programming problem is formulated from a data list collected from IWFM (BUET) which is a secondary data. The objective was to reduce the risk and hazard of the coastal area during natural disasters. They consider four parameters and they maximize cropping intensity and shelter and minimize erosion and population density. They selected four parameters defined as decision variables,
${x}_{1},{x}_{2},{x}_{3},{x}_{4}$ , which are risk and vulnerability indicators.
${x}_{1}$ for cropping intensity,
${x}_{2}$ * _{ }*for shelter,
${x}_{3}$

The objective function of fuzzy linear programming problem is by Nahar, *et al*.

$\begin{array}{l}\mathrm{max}Z=\left(0,\text{\hspace{0.17em}}0.00335,\text{\hspace{0.17em}}0.067\right){x}_{1}+\left(0,\text{\hspace{0.17em}}0.36,\text{\hspace{0.17em}}0.72\right){x}_{2}\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}+\left(-0.072,\text{\hspace{0.17em}}-0.036,\text{\hspace{0.17em}}0\right){x}_{3}+\left(-0.1413,\text{\hspace{0.17em}}-0.07065,\text{\hspace{0.17em}}0\right){x}_{4}\end{array}$

With fuzzy constraints

$\begin{array}{l}\left(6.0877,\text{\hspace{0.17em}}26,\text{\hspace{0.17em}}45.9123\right){x}_{1}+\left(41.7423,\text{\hspace{0.17em}}70,\text{\hspace{0.17em}}98.2577\right){x}_{2}+\left(-5.1243,\text{\hspace{0.17em}}7,\text{\hspace{0.17em}}19.1243\right){x}_{3}\\ +\left(3.7907,\text{\hspace{0.17em}}13.75,\text{\hspace{0.17em}}23.7093\right){x}_{4}\le \left(90.8769,\text{\hspace{0.17em}}95,\text{\hspace{0.17em}}99.1231\right)\end{array}$

Thus, the multiple objective functions become as like by Nahar, *et al*.

$\begin{array}{l}\mathrm{max}{Z}_{1}=0\text{\hspace{0.17em}}{x}_{1}+0\text{\hspace{0.17em}}{x}_{2}-0.072\text{\hspace{0.17em}}{x}_{3}-0.1413\text{\hspace{0.17em}}{x}_{4}\\ \mathrm{max}{Z}_{2}=0.00335\text{\hspace{0.17em}}{x}_{1}+0.36\text{\hspace{0.17em}}{x}_{2}-0.036\text{\hspace{0.17em}}{x}_{3}-0.07065\text{\hspace{0.17em}}{x}_{4}\\ \mathrm{max}{Z}_{3}=0.067\text{\hspace{0.17em}}{x}_{1}+0.72\text{\hspace{0.17em}}{x}_{2}+0\text{\hspace{0.17em}}{x}_{3}+0\text{\hspace{0.17em}}{x}_{4}\end{array}$ (16)

subject to

$\begin{array}{l}6.0877\text{\hspace{0.17em}}{x}_{1}+41.7423\text{\hspace{0.17em}}{x}_{2}+\left(-5.1243\right){x}_{3}+3.7907\text{\hspace{0.17em}}{x}_{4}\le 90.8769\\ \left(-19.9123\right){x}_{1}+\left(-28.2577\right){x}_{2}+\left(-12.1243\right){x}_{3}+\left(-9.9593\right){x}_{4}\le -4.1231\\ 52\text{\hspace{0.17em}}{x}_{1}+140\text{\hspace{0.17em}}{x}_{2}+14\text{\hspace{0.17em}}{x}_{3}+27.5\text{\hspace{0.17em}}{x}_{4}\le 190\end{array}$ (17)

For the first objective function in Equation (16) with same constraints in Equation (17), by applying simplex algorithm we get

${\varphi}_{1}=0$ with (0, 0.1459, 0, 0)

For the second objective function in Equation (16) with same constraints in Equation (17), by applying simplex algorithm we get

${\varphi}_{2}=0.4886$ with (0, 1.3571, 0, 0)

Similarly for third objective function, in equation (16) with same constraints in Equation (17), we get

${\varphi}_{3}=0.9771$ with (0, 1.3571, 0, 0)

4.1. Chandra Sen’s Method

Applying Chandra Sen’s method for making single objective function from multi objective functions

$\begin{array}{c}\mathrm{max}z=\frac{{z}_{1}}{{\varphi}_{1}}+\frac{{z}_{2}}{{\varphi}_{2}}+\frac{{z}_{3}}{{\varphi}_{3}}\\ =0.0754178{x}_{1}+1.47366{x}_{2}-0.0736812{x}_{3}-0.144599{x}_{4}\end{array}$

Thus, the single objective function becomes

$\mathrm{max}Z=0.0754178{x}_{1}+1.47366{x}_{2}-0.0736812{x}_{3}-0.144599{x}_{4}$ (18)

For this objective function in Equation (18) with same constraints in Equation (17) we get the result 2 with (0, 1.3571, 0, 0).

4.2. Statistical Averaging Method

Applying arithmetic mean, geometric mean and harmonic mean among ${\varphi}_{1},{\varphi}_{2},{\varphi}_{3}$

$\begin{array}{l}A.M=0.48857\\ G.M=0\\ H.M=0.97716\end{array}$

*Arithmetic averaging method: *

$\begin{array}{c}\mathrm{max}z=\frac{1}{A.M}\left({z}_{1}+{z}_{2}+{z}_{3}\right)\\ =0.154364{x}_{1}+3.016272{x}_{2}-0.150809{x}_{3}-0.295963{x}_{4}\end{array}$

Thus, the single objective function becomes

$\mathrm{max}Z=0.154364{x}_{1}+3.016272{x}_{2}-0.150809{x}_{3}-0.295963{x}_{4}$ (19)

For this objective function in Equation (19) with same constraints in equation (17) we get the result 4.0935 with (0, 1.3571, 0, 0).

*Harmonic averaging method: *

$\begin{array}{c}\mathrm{max}z=\frac{1}{H.M}\left({z}_{1}+{z}_{2}+{z}_{3}\right)\\ =0.07718{x}_{1}+1.508099{x}_{2}-0.0754031{x}_{3}-0.147978{x}_{4}\end{array}$

Thus, the single objective becomes

$\mathrm{max}Z=0.07718{x}_{1}+1.508099{x}_{2}-0.0754031{x}_{3}-0.147978{x}_{4}$ (20)

For this objective function in Equation (20) with same constraints in equation (17) we get the result 2.0467 with (0, 1.3571, 0, 0).

It can be seen from “Table 3” that in statistical averaging method, arithmetic averaging and harmonic averaging gives better result than those Chandra Sen’s method.

4.3. New Statistical Averaging Method

Choosing minimum from the optimal values of maximum type in Chandra Sen’s method we get m = 0.4886

$\begin{array}{c}\mathrm{max}z=\frac{1}{0.4886}\left({z}_{1}+{z}_{2}+{z}_{3}\right)\\ =2.0467\left(0.075417{x}_{1}+1.47366{x}_{2}-0.0736812{x}_{3}-0.144599{x}_{4}\right)\\ =0.15435{x}_{1}+3.01614{x}_{2}-0.1508{x}_{3}-\mathrm{0..29595}{x}_{4}\end{array}$

Thus, the single objective becomes

$\mathrm{max}Z=0.15435{x}_{1}+3.01614{x}_{2}-0.1508{x}_{3}-0.29595{x}_{4}$ (21)

For this objective function in Equation (21) with same constraints in equation (17) we get the result 4.0933 with (0, 1.3571, 0, 0).

It can be seen from “Table 4” that statistical averaging method and new statistical averaging method give better result than Chandra Sen’s method.

Table 3. Comparison between Chandra Sen’s method and statistical averaging method.

Table 4. Comparison among Chandra Sen’s method, statistical averaging method and new statistical averaging method.

4.4. Solving Multi-Objective Linear Programming Problem by Fuzzy Programming Method

$\begin{array}{l}\mathrm{max}{Z}_{1}=0\text{\hspace{0.17em}}{x}_{1}+0\text{\hspace{0.17em}}{x}_{2}-0.072\text{\hspace{0.17em}}{x}_{3}-0.1413\text{\hspace{0.17em}}{x}_{4}\\ \mathrm{max}{Z}_{2}=0.00335\text{\hspace{0.17em}}{x}_{1}+0.36\text{\hspace{0.17em}}{x}_{2}-0.036\text{\hspace{0.17em}}{x}_{3}-0.07065\text{\hspace{0.17em}}{x}_{4}\\ \mathrm{max}{Z}_{3}=0.067\text{\hspace{0.17em}}{x}_{1}+0.72\text{\hspace{0.17em}}{x}_{2}+0\text{\hspace{0.17em}}{x}_{3}+0\text{\hspace{0.17em}}{x}_{4}\end{array}$ (22)

subject to

$\begin{array}{l}6.0877{x}_{1}+41.7423{x}_{2}+\left(-5.1243\right){x}_{3}+3.7907{x}_{4}\le 90.8769\\ \left(-19.9123\right){x}_{1}+\left(-28.2577\right){x}_{2}+\left(-12.1243\right){x}_{3}+\left(-9.9593\right){x}_{4}\le -4.1231\\ 52{x}_{1}+140{x}_{2}+14{x}_{3}+27.5{x}_{4}\le 190\end{array}$ (23)

For the first objective function in Equation (22) with constraints in equation (23) by using simplex algorithm we get *z*_{1} = 0 with (0, 0.1459, 0, 0).

Similarly for second objective function in equation (22) with same constraints in Equation (23) by using simplex algorithm we get* z*_{2} = 1.224 with (3.6538, 0, 0, 0).

And for the last objective function in Equation (22) with same constraints in Equation (23) by using simplex algorithm we get *z*_{3} = 0.9771 with (0, 1.3571, 0, 0).

A pay-off matrix is formulated as in “Table 5”.

For the Pay-off matrix, lower and upper bound are established as:

$\begin{array}{l}0\le {z}_{1}\le 0\\ 0.0525\le {z}_{2}\le 1.224\\ 0.10505\le {z}_{3}\le 0.9771\end{array}$ (24)

Using the membership functions as defined and introducing augmented variable $\lambda $ a crisp model is formulated as

min $\lambda $

Subject to

$\begin{array}{l}0\text{\hspace{0.17em}}{x}_{1}+0\text{\hspace{0.17em}}{x}_{2}+\left(-0.072\right){x}_{3}-0.1413\text{\hspace{0.17em}}{x}_{4}\ge 0\\ 0.00335\text{\hspace{0.17em}}{x}_{1}+0.36\text{\hspace{0.17em}}{x}_{2}+\left(-0.036\right){x}_{3}+\left(-0.07065\right)\text{\hspace{0.17em}}{x}_{4}+1.1715\lambda \ge 1.224\\ 52\text{\hspace{0.17em}}{x}_{1}+140\text{\hspace{0.17em}}{x}_{2}+14\text{\hspace{0.17em}}{x}_{3}+27.5\text{\hspace{0.17em}}{x}_{4}+0.872\lambda \ge 0.9771190\end{array}$

$\begin{array}{l}6.0877\text{\hspace{0.17em}}{x}_{1}+41.7423\text{\hspace{0.17em}}{x}_{2}+\left(-5.1243\right){x}_{3}+3.7907\text{\hspace{0.17em}}{x}_{4}\le 90.8769\\ \left(-19.9123\right){x}_{1}+\left(-28.2577\right){x}_{2}+\left(-12.1243\right){x}_{3}+\left(-9.9593\right){x}_{4}\le -4.1231\\ 52\text{\hspace{0.17em}}{x}_{1}+140\text{\hspace{0.17em}}{x}_{2}+14\text{\hspace{0.17em}}{x}_{3}+27.5\text{\hspace{0.17em}}{x}_{4}\le 190\\ {x}_{1},{x}_{2},{x}_{3},{x}_{4},\lambda \ge 0\end{array}$ (25)

Table 5. Pay-off matrix.

Using simplex algorithm, we get the result ${x}_{1}=0,{x}_{2}=1.3571,{x}_{3}=0,{x}_{4}=0,\lambda =0.6278$

Finally, the crisp model is solved to get the result ${\varphi}_{1}=0,{\varphi}_{2}=0.4885,{\varphi}_{3}=0.977$

Using the value of Fuzzy Programming method applying Chanda Sen’s method

$\mathrm{max}z=0.0753{x}_{1}+1.47382{x}_{2}-0.0737{x}_{3}-0.1446{x}_{4}$ (26)

For the single objective function in Equation (26) with constraints in Equation (23), by using simplex algorithm we get *z** *= 2.002 with (0, 1.3571, 0, 0).

Applying arithmetic mean formula by Nahar and Alim (2017) we get the single objective function

$\mathrm{max}z=0.096{x}_{1}+1.474{x}_{2}-0.1474{x}_{3}-0.289{x}_{4}$ (27)

For the single objective function in Equation (27) with constraints in equation (23), by using simplex algorithm we get *z** *= 2.004 with (0, 1.3571, 0, 0).

Applying harmonic mean formula by Nahar and Alim (2017) we get the single objective function

$\mathrm{max}z=0.108{x}_{1}+1.658{x}_{2}-0.166{x}_{3}-0.325{x}_{4}$ (28)

For the single objective function in Equation (28) with constraints in Equation (23), by using simplex algorithm we get *z** *= 2.2501 with (0, 1.3571, 0, 0).

4.5. New Statistical Averaging Method

Choosing minimum from the optimal values of maximum type in Chandra Sen’s method we get *m** *= 0.4885

$\begin{array}{c}\mathrm{max}z=\frac{1}{0.2442}\left({z}_{1}+{z}_{2}+{z}_{3}\right)\\ =4.094\left(0.07035{x}_{1}+1.08{x}_{2}-0.108{x}_{3}-0.21195{x}_{4}\right)\\ =0.288{x}_{1}+4.4215{x}_{2}-0.442{x}_{3}-0.8677{x}_{4}\end{array}$ (29)

For this objective function in Equation (29) with same constraints in equation (23) we get the result 6.006 with (0, 1.3571, 0, 0).

It can be seen from “Table 6” that statistical averaging method and new statistical averaging method give better result than Chandra Sen’s method.

This table can be described in the following bar diagram in “Figure 2”.

Table 6. Comparison among Chandra Sen’s method, statistical averaging method and new statistical averaging method.

Figure 2. Optimal values of MOLPP by using ordinary and fuzzy programming method.

5. Conclusion

For finding optimal values here we apply simplex method and fuzzy programming method. Fuzzy programming method gives better optimal values than simplex method. Our next stage is making single objective function from multi-objective functions. For this we apply statistical averaging method and new statistical method. It can be seen that statistical averaging method gives better result than Chandra Sen’s method in both ordinary simplex method and in fuzzy programming method. To reduce risk in the coastal region fuzzy programming method is used here. It can be seen that risk reduction capacity is maximized in fuzzy programming method.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

[1] | Zadeh, L.A. (1965) Fuzzy Sets and Systems. In: Fox, J., Ed., System Theory (Microwave Research Institute Symposia Series XV), Polytechnic Press, Brooklyn, 29-37. |

[2] |
Zimmermann, H.-J. (1978) Fuzzy Programming and Linear Programming with Several Objective Functions. Fuzzy Sets and System, 1, 45-55. https://doi.org/10.1016/0165-0114(78)90031-3 |

[3] |
Tanaka, H. and Asai, K. (1984) Fuzzy Linear Programming Problems with Fuzzy Numbers. Fuzzy Sets and Systems, 13, 1-10. https://doi.org/10.1016/0165-0114(84)90022-8 |

[4] | Thakre, P.A., et al. (2009) Solving Fuzzy Linear Programming Problem as MOLPP. World Congress on Engineering 2009, London, 1-3 July 2009, 1-10. |

[5] | Mahdavi-Amiri, N., et al. (2009) Fuzzy Primal Simplex Algorithms for Solving Fuzzy Linear Programming Problems. Iranian Journal of Operational Research, 1, 68-84. |

[6] |
Nasseri, S.H. and Alizadeh, Z. (2011) Solving Linear Programming Problem with Fuzzy Right Hand Sides: A Penalty Method. The Journal of Mathematics and Computer Science, 3, 318-328. https://doi.org/10.22436/jmcs.03.03.05 |

[7] | Mishmast Nehi, H. and Hajmohamadi, H. (2011) A Ranking Function Method Solving Fuzzy Multi-Objective Linear Programming. Annals of Fuzzy Mathematics and Informatics, 3, 31-38. |

[8] | Kiruthiga, M. and Loganathan, C. (2015) Fuzzy MOLPP Using Fuzzy Programming Model. International Journal of Science, Engineering and Technology Research, 4, Issue 7. |

[9] |
Nahar, S. and Alim, M.A. (2017) A New Geometric Average Technique to Solve Multi-Objective Linear Fractional Programming Problem and Comparison with New Arithmetic Average Technique. IOSR Journal of Mathematics (IOSR-JM), 13, 39-52. https://doi.org/10.9790/5728-1303013952 |

[10] | Sen, C. (1983) A New Approach for Multi Objective Rural Development Planning. The Indian Economic Journal, 30, 91-96. |

[11] |
Nahar, S., Akter, M. and Alim, M.A. (2022) Solving Fuzzy Multi-Objective Linear Programming Problem by Applying Statistical Method. American Journal of Operation Research, 12, 293-309. https://doi.org/10.4236/ajor.2022.126016 |

Journals Menu

Contact us

+1 323-425-8868 | |

customer@scirp.org | |

+86 18163351462(WhatsApp) | |

1655362766 | |

Paper Publishing WeChat |

Copyright © 2024 by authors and Scientific Research Publishing Inc.

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.