
## And We Set Bc D == = = 1, .001, 0.2 And 13.8 Ε [15].

The aspiration of the objective function is calculated by solving the following: 
x x x
+ +
12 3
. x +. x +. x ;
≤
12 3
. x +. x +. x ;
≤
1 23 3 Maximize 1.08 0.4 2.0 subject to 0033 001 0033 208 056 025 1 4368 0067 004 017 520 01 01 01 780 25000 40000 10000
. x +. x +. x ;
≤
123
. x +. x +. x ;
≤
123
≥
x ;
1
 (6) 
x ;
≥
2 x ;
≥
which gives the optimal value of the objective function as 67203.88 for 1x = 29126.21, 2 x =35000.00 and 3 x =10873.79 
[15]. 

With the help of the program LINGO version 10.0 we obtain the following results [15]: 
10233 01, 0 4911863 λ *. x . x .*
x .. η
===
= = 
0 5323011, 27766 99, 40000 00, 1 2 3 Therefore, to achieve maximum profit the home-textile group should plan for a monthly production of 27766.99 sheet units, 40000 pillow case units and 102333.01 quilt units. This plan gives an overall satisfaction of 0.5323011. The decision making method may be improved further by adopting a recursive iteration methodology. 

## Iv. Results And Discussion

The numerical example is solved by using a recursive method for various iterations. This was carried out using the C++ programming language on a personal computer with a dual core processor running at 2 GHz [16]–[17]. Fig. 1 shows the 3D outcome of the iterations with M = 748 for various alpha values with respect to the objective function G. The values of α1 and α 2 vary from 0 to 1. The optimum values for the objective function as per Fig. 1 are 86,807.7 (maximum) and 86,755.4 (minimum). 

![0_image_0.png](0_image_0.png)

Fig. 2 shows the 3D outcome for M = 749 iterations and 

![0_image_1.png](0_image_1.png) various alpha values with respect to G. The optimum values for the objective function as per this figure are 86,691.8 (maximum) and 86,639.5 (minimum). Fig. 3 shows the 3D outcome for M = 750 iterations and 

![0_image_2.png](0_image_2.png) various alpha values with respect to G. The optimum values for the objective function as per this figure are 86,576.2 (maximum) and 86,524.0 (minimum). 