On Multivariate Discrete Moment Problems and Their Applications to Bounding Expectations and Probabilities
Published Online:1 May 2004https://doi.org/10.1287/moor.1030.0064
References
- Actuarial Mathematics (1997) 2nd ed.(The Society of Actuaries, Ithaca, IL) Google Scholar
- Topics in Matrix Analysis (1991) (Cambridge University Press, New York) Crossref, Google Scholar
- Analysis of Numerical Methods (1966) (Wiley, New York) Google Scholar
- Calculus of Finite Differences (1947) (Chelsea Publishing Company, New York) Google Scholar
- The dual method for solving the linear programming problem. Naval Res. Logist. Quart. (1954) 1:36–47Crossref, Google Scholar
- Les Fonctions Convexes. Actualités Scientifiques et Industrielles 992 (1944) (Hermann, Paris, France) Google Scholar
- Boole-Bonferroni inequalities and linear programming. Oper. Res. (1988) 36:145–162Link, Google Scholar
- Sharp bounds on probabilities using linear programming. Oper. Res. (1990a) 38:227–239Link, Google Scholar
- The discrete moment problem and linear programming. Discrete Appl. Math. (1990b) 27:235–254Crossref, Google Scholar
- , Shaked M., Tong Y. L. Inequalities on expectations based on the knowledge of multivariate moments. Stochastic Inequalities. Institute of Mathematical Statistics (1992) 22(Institute of Mathematical Statistics, Hayward, CA) 309–331Lecture Notes—Monograph SeriesCrossref, Google Scholar
- A brief introduction to linear programming. Math. Scientist (1996) 21:85–111Google Scholar
- Bounds on probabilities and expectations using multivariate moments of discrete distributions. Studia Scientiarum Mathematicarum Hungarica (1998) 34:349–378Google Scholar
- On multivariate discrete higher order convex functions and their applications. Proc. Sixth Internat. Conf. on Generalized Convexity and Monotonicity (2001) August 29–September 2Karlovasi, Samos, Greece(Springer, Heidelberg, Germany) 21–47Lecture Notes in Economics and Mathematical SystemsCrossref, Google Scholar
- On the existence of a feasible flow in a stochastic transportation network. Oper. Res. (1991) 39:119–129Link, Google Scholar
- On the numerical solution of discrete power moment problems. (2002) . RUTCOR Research Report 99-2002, Rutgers University, Piscataway, NJGoogle Scholar
- , Roberts F., Hwang F., Monma C. The use of binomial moments for bounding network reliability. Reliability of Computer and Communication Networks (1991) 5(American Mathematical Society, Providence, RI) 197–212DIMACS Series in Discrete Mathematics and Theoretical Computer ScienceCrossref, Google Scholar
- Lower and upper bounds on probabilities of Boolean function of events. (1997) . RUTCOR Research Report 21-97, Rutgers University, Piscataway, NJGoogle Scholar
- , Baker G. A., Gammel J. L. Bounds for averages using moment constraints. The Padé Approximant in Theoretical Physics (1970) (Academic Press, New York) 99–127Crossref, Google Scholar
- Wolfram Mathematica (2004) . www.wolfram.comGoogle Scholar

