×

Estimating the size of the calling population in finite-source election queues by bilinear programming techniques. (English) Zbl 1170.90360

Summary: 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.

MSC:

90B22 Queues and service in operations research
60K25 Queueing theory (aspects of probability theory)
90C08 Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
60K30 Applications of queueing theory (congestion, allocation, storage, traffic, etc.)
Full Text: DOI

References:

[1] Statistical Abstract of the United States, The National Data Book, 119 Ed. US CENSUS, 2004; Statistical Abstract of the United States, The National Data Book, 119 Ed. US CENSUS, 2004
[2] M. Powell, P. Slevin, Several factors contributed to “lost” voters in Ohio, The Washington Post, December 15, 2004; M. Powell, P. Slevin, Several factors contributed to “lost” voters in Ohio, The Washington Post, December 15, 2004
[3] P. Donovan, It was about poor’s people right to vote, The Irish World, November 12, 2004; P. Donovan, It was about poor’s people right to vote, The Irish World, November 12, 2004
[4] J. Jones, (reviewed by) US Election 2004 Transcript of BBC 1, November 2, 2004; J. Jones, (reviewed by) US Election 2004 Transcript of BBC 1, November 2, 2004
[5] Rev.J. Jackson, Something Fishy in Ohio, Chicago Sunday Times, November 30, 2004; Rev.J. Jackson, Something Fishy in Ohio, Chicago Sunday Times, November 30, 2004
[6] Nickerson, D.; Friedrichs, R.; King, D., Partizan mobilization campaigns in the field: results from a state turnout experiment Michigan, Political Research Quarterly, 59, 85-98 (2006)
[7] D. King, Youth came through with big voter turnout, The Boston Globe, November 4, 2004; D. King, Youth came through with big voter turnout, The Boston Globe, November 4, 2004
[8] Contesting Ohio Electoral Votes, Transcript of Press Conference: Senator Barbara Boxer and Rep. Stephanie Tubbs Jones, Federal News Service, January 6, 2005; Contesting Ohio Electoral Votes, Transcript of Press Conference: Senator Barbara Boxer and Rep. Stephanie Tubbs Jones, Federal News Service, January 6, 2005
[9] Letter Dated December 2, 2004, http://glob alresearch.ca/articles/HRE412A.html; Letter Dated December 2, 2004, http://glob alresearch.ca/articles/HRE412A.html
[10] Meris, S., None of the Above: Why Non-Voters Are American’s Majority (1996), CRC Press: CRC Press New York
[11] J. Walhman, Presidential Logic, The Brookline Bulletin, March 4, 2004; J. Walhman, Presidential Logic, The Brookline Bulletin, March 4, 2004
[12] A. Belenky, The 2004 election: local polls and campaign strategies, The Brookline Bulletin, June 22, 2004; A. Belenky, The 2004 election: local polls and campaign strategies, The Brookline Bulletin, June 22, 2004
[13] Belenky, A.; Larson, R., To queue or not to queue? In a US Presidential election, that should NOT be a question!, OR/MS Today, June (2006)
[14] Estrich, S., Case for Hillary Clinton (2005), HarperCollins Publishers: HarperCollins Publishers New York
[15] Morris, D.; McGann, E., Condi vs. Hillary: The Next Great Presidential Race (2005), HarperCollins Publishers: HarperCollins Publishers New York
[16] A. Belenky, R. Larson, Voting shouldn’t require a heroic act of patience, The Christian Science Monitor, September 12, 2006; A. Belenky, R. Larson, Voting shouldn’t require a heroic act of patience, The Christian Science Monitor, September 12, 2006
[17] Drake, A., Applied Probability Theory (1967), McGrow-Hill Higher Education: McGrow-Hill Higher Education New York · Zbl 0183.19302
[18] Demianov, V.; Malozemov, V., Introduction to Minimax (1974), John Waley & Sons: John Waley & Sons New York · Zbl 0781.90079
[19] White, D., A linear programming apporach to solving bilinear programmes, Mathematical Programming, 56, 45-50 (1992) · Zbl 0784.90052
[20] Bertsekas, D.; Tsitsiklis, J., Parallel and Distributed Computation: Numerical methods (1997), Athena Scientific: Athena Scientific Nashua, NH
[21] Gross, D.; Harris, C., Fundamentals of Queuing Theory (1998), Wiley-Interscience: Wiley-Interscience New York · Zbl 0949.60002
[22] State Results. President by County, USA Today, November 4, 2004; State Results. President by County, USA Today, November 4, 2004
[23] Swain, J., Essential tools of the trade, OR/MS Today, 32, 1, 42-51 (2005)
[24] Fourer, R., Linear programming, OR/MS Today, 32, 3, 46-55 (2005)
[25] T. Edswall, Democrats’ data minig stirs an intraparty battle, The Washington Post, March 8, 2006; T. Edswall, Democrats’ data minig stirs an intraparty battle, The Washington Post, March 8, 2006
[26] Berman, O.; Chin, S.; Larson, R.; Odoni, A.; Batta, R., Location of mobile units in a stochastic environment, (Discrete Location Theory, Interdisciplinary Discrete Mathematics Optimization (1970), J. Wiley and Sons: J. Wiley and Sons New York) · Zbl 0738.90043
[27] Belenky, A., Operations Research in Transportation Systems: Ideas and Schemes of Optimization Methods for Strategic Planning and Operations Management (2004), Kluwer Academic Publishers: Kluwer Academic Publishers Boston, Dordrecht, London · Zbl 0949.90004
[28] Ben-Tal, A.; Goryashko, A.; Guslitzer, E.; Nemirovski, A., Adjustable robust solutions of uncertain linear programs, Mathematical Programming. Ser. A, 99, 351-376 (2004) · Zbl 1089.90037
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.