An Equilibrium Chance-Constrained Multiobjective Programming Model with Birandom Parameters and Its Application to Inventory Problem

<table class="table-group" id="tab3"><tr><td><table class="table"><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr class="thead"><td align="left"> </td><td align="center"><span style="width: 17.049999px;"><svg height="15.6875" id="M482" style="vertical-align:-3.3907pt" version="1.1" viewbox="0 0 17.049999 15.6875" width="17.049999" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.4)"><path d="M745 361q0 -134 -83.5 -233t-214.5 -130l16 -11q97 -67 250 -132l-8 -23q-76 3 -131 16q-81 19 -242 125l-20 13q-129 8 -209 91t-80 208q0 160 116 271t289 111q136 0 226.5 -83t90.5 -223zM645 356q0 127 -57.5 201.5t-169.5 74.5q-126 0 -210.5 -104.5t-84.5 -248.5
q0 -97 46 -166.5t129 -87.5l84 15l29 -19q104 21 169 121.5t65 213.5z" id="x1D444"></path></g>
<g transform="matrix(.012,-0,0,-.012,13.113,15.475)"><path d="M244 607q0 -25 -15.5 -43t-37.5 -18q-19 0 -32 13t-13 35q0 21 15 41t39 20q20 0 32 -14t12 -34zM222 91q-29 -33 -79 -68t-75 -35q-13 0 -19 7.5t-6 31t10 65.5l62 253q5 26 -1 26q-21 0 -72 -43l-13 24q43 40 91 68t71 28q30 0 10 -78l-71 -274q-8 -30 3 -30
q16 0 76 48z" id="x1D456"></path></g>
</svg></span></td><td align="center"><span style="width: 10.375px;"><svg height="11.9625" id="M483" style="vertical-align:-3.3907pt" version="1.1" viewbox="0 0 10.375 11.9625" width="10.375" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,7.675)"><path d="M352 391q0 -31 -27 -44q-14 -7 -24 6q-39 48 -84 48q-23 0 -39.5 -15t-16.5 -40q0 -43 73 -90q49 -32 70 -58t21 -57q0 -58 -62 -105.5t-129 -47.5q-40 0 -75.5 25t-35.5 52q0 28 32 46q7 4 15 3t11 -6q19 -31 48.5 -50.5t54.5 -19.5q34 0 54 19.5t20 42.5q0 43 -65 81
q-97 56 -97 123q0 50 51 96q19 17 58 32.5t62 15.5q37 0 61 -18t24 -39z" id="x1D460"></path></g>
<g transform="matrix(.012,-0,0,-.012,6.438,11.762)"><path d="M244 607q0 -25 -15.5 -43t-37.5 -18q-19 0 -32 13t-13 35q0 21 15 41t39 20q20 0 32 -14t12 -34zM222 91q-29 -33 -79 -68t-75 -35q-13 0 -19 7.5t-6 31t10 65.5l62 253q5 26 -1 26q-21 0 -72 -43l-13 24q43 40 91 68t71 28q30 0 10 -78l-71 -274q-8 -30 3 -30
q16 0 76 48z" id="x1D456"></path></g>
</svg></span></td></tr><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr><td align="left"> Eggs </td><td align="center">2405.6</td><td align="center">1288.0</td></tr><tr><td align="left">Dairy  products</td><td align="center">3423.8</td><td align="center">2288.0</td></tr><tr><td align="left">Grains </td><td align="center">5400.5</td><td align="center">1288.0</td></tr><tr><td align="left">Meat  products </td><td align="center">2436.9</td><td align="center">1280.5</td></tr><tr class="table-tr"><td colspan="3"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Optimal order quantities and reorder points.

Journal of Applied Mathematics

tab3

Table 3

Table 3: An Equilibrium Chance-Constrained Multiobjective Programming Model with Birandom Parameters and Its Application to Inventory Problem 