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

DOI10.1016/j.mcm.2006.08.007zbMath1170.90360OpenAlexW2054380867MaRDI QIDQ2473232

A. S. Belen'kij

Publication date: 26 February 2008

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2006.08.007

zbMATH Keywords

linear programming problemsvoter turnoutfinite source queuing systemsbilinear programming problemsprecinctsvoting machines

Mathematics Subject Classification ID

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

Related Items (2)

Analysis of Various Parameters of Limited Source Queuing Model Having Single Server by Using Binomial and Uniform Distribution ⋮ Effect of upper and lower withdrawal limits on queue length

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear programming approach to solving bilinear programmes
• Operations research in transportation systems. Ideas and schemes of optimization methods for strategic planning and operations management
• Adjustable robust solutions of uncertain linear programs

This page was built for publication: Estimating the size of the calling population in finite-source election queues by bilinear programming techniques