Maximum likelihood estimation of cell probabilities in constrained multinomial models

DOI10.1080/00949659808811906zbMath0940.62017OpenAlexW2127052041MaRDI QIDQ4253300

Yehuda Vardi, Uriel G. Rothblum

Publication date: 17 July 2000

Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00949659808811906

zbMATH Keywords

maximum likelihood estimationmultinomial modelnonlinear knapsack

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• An O(n) algorithm for quadratic knapsack problems
• Solving certain singly constrained convex optimization problems in production planning
• Time bounds for selection
• A nonlinear knapsack problem
• Technical Note—Allocation of Effort Resources among Competing Activities
• Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
• An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems

This page was built for publication: Maximum likelihood estimation of cell probabilities in constrained multinomial models