Department of Mathematics, H.P. University, Shimla-171005
Online published on 22 February, 2013.
We use techniques of linear programming to give alternative proofs of the inequalities between the moments of the discrete uniform distributions. In this context we also discuss the variance bounds such as Samuelson’s and Brunk’s inequalities.
Cauchy’s inequality, moments, variance, Lagrangean function, discrete distributions
