×

Conjugate gradient method approach to queue theory. (English) Zbl 1075.65092

Summary: The conjugate gradient method (CGM) algorithm is used to solve queue problems. The system parameters of queue theory are used to form the entries of the control matrix operator \(A\) associated with the CGM algorithm. The resulting control problem is solved and some comparative results are generated.

MSC:

65K10 Numerical optimization and variational techniques
65C50 Other computational problems in probability (MSC2010)
49J15 Existence theories for optimal control problems involving ordinary differential equations
60K25 Queueing theory (aspects of probability theory)
Full Text: DOI

References:

[1] Murdoch J., Queuing Theory (1978) · doi:10.1007/978-1-349-03311-9
[2] Cohen S. S., Operational Research (1995)
[3] Tah H. A., Operational Research, 4. ed. (1987)
[4] Cook T. M., Introduction to Management Science, 2. ed. (1981)
[5] Ibiejugba, M. A. 1980. ”Computing methods in optimal control”. England: University of Leeds. PhD thesis
[6] Di Pillo G., Ric Automatica 3 pp 54– (1972)
[7] Hestenes M., Journal of Research of the National Bureau of Standards 49 pp 409– (1952) · Zbl 0048.09901 · doi:10.6028/jres.049.044
[8] Omolehin, J. O. 1992. ”The control of reaction diffusion equations”. Nigeria: University of Ilorin. PhD thesis
[9] Ibiejugba M. A., Journal of Mathematical Association of Nigeria 17 (1) pp 109– (1986)
[10] Ibiejugba M. A., Journal of Mathematical Association of Nigeria 17 (1) pp 19– (1986)
[11] Aderibigbe, F. M. 1987. ”An extendend conjugate gradient method algorithm for evolution equations”. Nigeria: University of Ilorin. PhD thesis
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.