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

DOI10.1016/J.MCM.2006.08.007MaRDI QIDQ2473232zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Voting systems as linear transformation models
• scientific article; zbMATH DE number 1357935
• An optimization problem in queueing theory and a numerical solution method
• Single-line queue with finite source and repeated calls
• Polling: past, present, and perspective

Cites work

• scientific article; zbMATH DE number 9248 (Why is no real title available?)
• scientific article; zbMATH DE number 51950 (Why is no real title available?)
• scientific article; zbMATH DE number 1416627 (Why is no real title available?)
• scientific article; zbMATH DE number 3291629 (Why is no real title available?)
• A linear programming approach to solving bilinear programmes
• Adjustable robust solutions of uncertain linear programs
• Operations research in transportation systems. Ideas and schemes of optimization methods for strategic planning and operations management

Cited in

(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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2473232)