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

作     者：Belenky, A. S. 

作者机构：NISTRAMAN Consulting Brookline MA 02446 USA MIT Ctr Engn Syst Fundamentals Cambridge MA 02139 USA 

出 版 物：《MATHEMATICAL AND COMPUTER MODELLING》 (数学与计算机模型建立)

年 卷 期：2007年第45卷第7-8期

页      面：873-882页

核心收录：

学科分类：07[理学] 0835[工学-软件工程] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 070101[理学-基础数学] 

主　　题：bilinear programming problems finite source queuing systems linear programming problems precincts voter turnout voting machines 

摘      要：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. (c) 2006 Elsevier Ltd. All rights reserved.