This paper uses revealed preference inequalities to provide the tightest possible (best) nonparametric bounds on predicted consumer responses to price changes using consumer-level data over a finite set of relative price changes. These responses are allowed to vary nonparametrically across the income distribution. This is achieved by combining the theory of revealed preference with the semipara...

This paper uses revealed preference inequalities to provide the tightest possible (best) nonparametric bounds on predicted consumer responses to price changes using consumer-level data over a finite set of relative price changes. These responses are allowed to vary nonparametrically across the income distribution. This is achieved by combining the theory of revealed preference with the semipara...

Let L = ∆+Z for a C1 vector field Z on a complete Riemannian manifold possibly with a boundary. By using the uniform distance, a number of transportation-cost inequalities on the path space for the (reflecting) L-diffusion process are proved to be equivalent to the curvature condition Ric−∇Z ≥ −K and the convexity of the boundary (if exists). These inequalities are new even for manifolds withou...

Let L = ∆ + Z for a C vector field Z on a complete Riemannian manifold possibly with a boundary. A number of transportation-cost inequalities on the path space for the (reflecting) L-diffusion process are proved to be equivalent to the curvature condition Ric−∇Z ≥ −K and the convexity of the boundary (if exists). These inequalities are new even for manifolds without boundary, and are partly ext...

We consider the path space of a manifold with measure induced by stochastic flow an infinitesimal generator that is hypoelliptic, but not elliptic. These generators can be seen as sub-Laplacians sub-Riemannian structure chosen complement. introduce concept gradient for cylindrical functionals on in such way operators are closable L2. With this place, we show bound horizontal Ricci curvature equ...

This work presents an exact branch-cut-and-price (BCP) algorithm for the vehicle routing problem with time windows (VRPTW) where the well-known clique inequalities are used as cutting planes defined on the set partitioning master problem variables. It is shown how these cutting planes affect the dominance criterion applied in the pricing algorithm, which is a labeling algorithm for solving the ...