A Conic Programming Approach to Generalized Tchebycheff Inequalities

Authors:
Luis F. Zuluaga;Javier F. Peña
Affiliations:
-;-
Venue:
Mathematics of Operations Research
Year:
2005

Citing 0
Cited 4

A semidefinite optimization approach to the steady-state analysis of queueing systems

Queueing Systems: Theory and Applications
Constructing Risk Measures from Uncertainty Sets

Operations Research
Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation

Operations Research
Tight Bounds for Some Risk Measures, with Applications to Robust Portfolio Selection

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider the problem of finding optimal bounds on the expected value of piecewise polynomials over all measures with a given set of moments. This is a special class ofgeneralized Tchebycheff inequalities in probability theory. We study this problem within the framework of conic programming. Relying on a general approximation scheme for conic programming, we show that these bounds can be numerically computed or approximated via semidefinite programming. We also describe some applications of this class of generalized Tchebycheff inequalities in probability, finance, and inventory theory.