Efficient Method to Approximately Solve Retrial Systems with Impatience

<table>Relative error in <svg height="15.4" id="M263" style="vertical-align:-3.39064pt" version="1.1" viewbox="0 0 28.549999 15.4" width="28.549999" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.112)"><use xlink:href="#x1D441"></use></g>
<g transform="matrix(.012,-0,0,-.012,14.925,15.187)"><use xlink:href="#x72"></use></g><g transform="matrix(.012,-0,0,-.012,19.185,15.187)"><use xlink:href="#x65"></use></g><g transform="matrix(.012,-0,0,-.012,24.242,15.187)"><use xlink:href="#x74"></use></g>
</svg> versus computation cost.</table>

Journal of Applied Mathematics

fig10

Figure 10

Figure 10: Efficient Method to Approximately Solve Retrial Systems with Impatience 