Mixed-integer rounding (MIR) is a simple, yet powerful procedure for generating valid inequalities for mixed-integer programs. When used as cutting planes, MIR inequalities are very effective for mixed-integer programming problems with unbounded integer variables. For problems with bounded integer variables, however, cutting planes based on lifting techniques appear to be more effective. This i...

The terrain of gender inequalities in education has seen much change in recent decades. This article reviews the empirical research and theoretical perspectives on gender inequalities in educational performance and attainment from early childhood to young adulthood. Much of the literature on children and adolescents attends to performance differences between girls and boys. Of course, achieveme...

Abstract. We propose a prox-type method with efficiency estimate O(2−1) for approximating saddle points of convex-concave C1,1 functions and solutions of variational inequalities with monotone Lipschitz continuous operators. Application examples include matrix games, eigenvalue minimization and computing Lovasz capacity number of a graph and are illustrated by numerical experiments with large-s...

This paper addresses a multi-stage stochastic integer programming formulation of the uncapacitated lot-sizing problem under uncertainty. We show that the classical (`, S) inequalities for the deterministic lot-sizing polytope are also valid for the stochastic lot-sizing polytope. We then extend the (`, S) inequalities to a general class of valid inequalities, called the (Q, SQ) inequalities, an...

We propose two algorithms for deciding if systems of Walrasian inequalities are solvable. These algorithms may serve as nonparametric tests for multiple calibration of applied general equilibrium models or they can be used to compute counterfactual equilibria in applied general equilibrium models defined by systems of Walrasian inequalities.

z The local displacement of an object is very useful for deciding grasp stability, generating trajectories, recognizing assembly tasks, and so on. To calculate this displacement, the screw theory is employed. It is equivalent to the first order Taylor expansion of the displacement. The screw theory is very convenient, because the displacement is formulated as simultaneous linear inequalities, a...

We present a new operator equality in the framework of Hilbert C∗-modules. As a consequence, we get an extension of the Euler–Lagrange type identity in the setting of Hilbert bundles as well as several generalized operator Bohr’s inequalities due to O. Hirzallah, W.-S. Cheung–J.E. Pečarić and F. Zhang.

a r t i c l e i n f o a b s t r a c t Keywords: The Laplace operator for graphs The Harnack inequalities Eigenvalues Diameter We establish a Harnack inequality for finite connected graphs with non-negative Ricci curvature. As a consequence, we derive an eigenvalue lower bound, extending previous results for Ricci flat graphs.

In this paper, two pairs of new inequalities are given, which decompose two Hilbert-type inequalities.