Estimating the size of the calling population in finite-source election queues by bilinear programming techniques

Finite source multi-server queuing systems represent a particular type of an exact model of voting places (precincts) servicing voters on the election day. The size of the calling population from which the arrivals (voters) come to vote in a precinct at each time segment of the election day is among key parameters of such systems. The problem of finding this parameter is formulated as the problem of maximizing the maximum function of a finite number of bilinear functions on polyhedra, and it can be solved with the use of bilinear programming techniques.