Solving a Fully Fuzzy Linear Programming Problem through Compromise Programming

The pay-off matrix of <a href="https://static.hindawi.com/articles/jam/volume-2013/726296/figures/#eq35"><i><svg height="15.0875" id="M359" style="vertical-align:-2.21327pt" version="1.1" viewbox="0 0 42.099998 15.0875" width="42.099998" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,12.138)"><path d="M300 -147l-18 -23q-106 71 -159 185.5t-53 254.5v1q0 139 53 252.5t159 186.5l18 -24q-74 -62 -115.5 -173.5t-41.5 -242.5q0 -130 41.5 -242.5t115.5 -174.5z" id="x28"></path></g><g transform="matrix(.017,-0,0,-.017,36.162,12.138)"><path d="M275 270q0 -296 -211 -440l-19 23q75 62 116.5 174t41.5 243t-42 243t-116 173l19 24q211 -144 211 -440z" id="x29"></path></g><g transform="matrix(.017,-0,0,-.017,5.95,11.875)"><path d="M517 162l29 -4q-18 -100 -35 -158h-482v28q68 5 83.5 20t15.5 77v398q0 66 -13 80t-73 19v28h446q0 -8 8 -144l-29 -4q-11 51 -32 85q-11 17 -35 23t-78 6h-76q-23 0 -28 -5t-5 -27v-228h94q67 0 83 12t25 63h29v-191h-29q-10 54 -26 65.5t-81 11.5h-95v-189
q0 -65 24 -81q19 -13 104 -13q57 0 83 7t43 27q28 33 50 94z" id="x45"></path></g><g transform="matrix(.017,-0,0,-.017,15.605,11.875)"><path d="M46 650h247q112 0 169 -41q64 -49 64 -141q0 -91 -56.5 -143t-138.5 -62q-23 -3 -45 -1l-74 19v-157q0 -63 15.5 -77t83.5 -19v-28h-271v28q60 5 74 20t14 77v400q0 65 -12.5 79t-69.5 18v28zM212 559v-245q31 -12 73 -12q59 0 102 38t43 124q0 77 -42.5 115.5
t-108.5 38.5q-44 0 -56 -12q-11 -8 -11 -47z" id="x50"></path></g><g transform="matrix(.017,-0,0,-.017,27.997,11.875)"><path d="M412 140l28 -9q0 -2 -35 -131h-373v23q112 112 161 170q59 70 92 127t33 115q0 63 -31 98t-86 35q-75 0 -137 -93l-22 20l57 81q55 59 135 59q69 0 118.5 -46.5t49.5 -122.5q0 -62 -29.5 -114t-102.5 -130l-141 -149h186q42 0 58.5 10.5t38.5 56.5z" id="x32"></path></g>
</svg></i></a>.

Journal of Applied Mathematics

tab2

Table 2

Table 2: Solving a Fully Fuzzy Linear Programming Problem through Compromise Programming 