Thumbnail
Access Restriction
Subscribed

Author Kotiah, Thoddi C. T. ♦ Steinberg, David I.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Queueing models ♦ Cycling ♦ Linear programming
Abstract An investigation into the average queue size for a certain class of queues has resulted in the formulation of linear programming problems which are ill-conditioned in some cases. In attempting to solve these linear programming models, using IBM's MPS package, instances of cycling were encountered. Small perturbations in the input data resulted in problems which did not cycle. This fact, plus several other observed phenomena suggest that the primary reason that cycling is not known to occur more frequently is that round-off errors in the computations perturb the problem sufficiently to prevent cycling (or at least to prevent indefinite cycling). In one case maximizing and minimizing an objective function subject to the same constraint set was attempted, but MPS solved only one of these while giving an indication of infeasibility for the other.
Description Affiliation: Southern Illinois Univ., Edwardsville, FL (Kotiah, Thoddi C. T.; Steinberg, David I.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 20
Issue Number 2
Page Count 6
Starting Page 107
Ending Page 112


Open content in new tab

   Open content in new tab
Source: ACM Digital Library