Benders,metric and cutset inequalities for multicommodity capacitated network design

Solving multicommodity capacitated network design problems is a hard task that requires the use of several strategies like relaxing some constraints and strengthening the model with valid inequalities. In this paper, we compare three sets of inequalities that have been widely used in this context: Benders, metric and cutset inequalities. We show that Benders inequalities associated to extreme rays are metric inequalities. We also show how to strengthen Benders inequalities associated to non-extreme rays to obtain metric inequalities. We show that cutset inequalities are Benders inequalities, but not necessarily metric inequalities. We give a necessary and sufficient condition for a cutset inequality to be a metric inequality. Computational experiments show the effectiveness of strengthening Benders and cutset inequalities to obtain metric inequalities.     

Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut

We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a “ring”) to which each edge belongs, does not exceed a given length K. We identify a class of inequalities, called cycle inequalities, valid for the problem and show that these inequalities together with the so-called cut inequalities yield an integer programming formulation of the problem in the space of the natural design variables. We then study the polytope associated with that problem and describe further classes of valid inequalities. We give necessary and sufficient conditions for these inequalities to be facet defining. We study the separation problem associated with these inequalities. In particular, we show that the cycle inequalities can be separated in polynomial time when K≤4. We develop a Branch-and-Cut algorithm based on these results and present extensive computational results.     

A recursive procedure to generate all cuts for 0–1 mixed integer programs

We study several ways of obtaining valid inequalities for mixed integer programs. We show how inequalities obtained from a disjunctive argument can be represented by superadditive functions and we show how the superadditive inequalities relate to Gomory's mixed integer cuts. We also show how all valid inequalities for mixed 0–1 programs can be generated recursively from a simple subclass of the disjunctive inequalities.The research of this author was supported by NSF Contract No. ECS-8540898.     

Relationships Among Flag <Emphasis Type="Italic">f</Emphasis>-Vector Inequalities for Polytopes

We examine linear inequalities satisfied by the flag $f$-vectors of polytopes. One source of these inequalities is the toric $g$-vector; convolutions of its entries are non-negative for rational polytopes. We prove a conjecture of Meisinger about a redundancy in these inequalities. Another source of inequalities is the {\bf cd}-index; among all $d$-polytopes, each {\bf cd}-index coefficient is minimized on the $d$-simplex. We show that not all of the {\bf cd}-index inequalities are implied by the toric $g$-vector inequalities, and that not all of the toric $g$-vector inequalities are implied by the {\bf cd}-index inequalities. Finally, we show that some inequalities from convolutions of {\bf cd}-index coefficients are implied by other {\bf cd}-index inequalities.     

Operator inequalities and reverse inequalities related to the Kittaneh–Manasrah inequalities

This work is concerned with exploring more refinement forms of the Young inequalities and the Kittaneh–Manasrah inequalities. We deduce the Operator version inequalities and reverse version inequalities related to the Kittaneh–Manasrah inequalities.     

Best constants in the Hardy-Rellich inequalities and related improvements

We consider Hardy-Rellich inequalities and discuss their possible improvement. The procedure is based on decomposition into spherical harmonics, where in addition various new inequalities are obtained (e.g. Rellich-Sobolev inequalities). We discuss also the optimality of these inequalities in the sense that we establish (in most cases) that the constants appearing there are the best ones. Next, we investigate the polyharmonic operator (Rellich and higher order Rellich inequalities); the difficulties arising in this case come from the fact that (generally) minimizing sequences are no longer expected to consist of radial functions. Finally, the successively use of the Rellich inequalities lead to various new higher order Rellich inequalities.     

Projection methods for nonconvex variational inequalities

In this paper, we introduce and consider a new class of variational inequalities, which is called the nonconvex variational inequalities. We establish the equivalence between the nonconvex variational inequalities and the fixed-point problems using the projection technique. This equivalent formulation is used to discuss the existence of a solution of the nonconvex variational inequalities. We also use this equivalent alternative formulation to suggest and analyze a new iterative method for solving the nonconvex variational inequalities. We also discuss the convergence of the iterative method under suitable conditions. Our method of proof is very simple as compared with other techniques.     

Mixing mixed-integer inequalities

Mixed-integer rounding (MIR) inequalities play a central role in the development of strong cutting planes for mixed-integer programs. In this paper, we investigate how known MIR inequalities can be combined in order to generate new strong valid inequalities.?Given a mixed-integer region S and a collection of valid “base” mixed-integer inequalities, we develop a procedure for generating new valid inequalities for S. The starting point of our procedure is to consider the MIR inequalities related with the base inequalities. For any subset of these MIR inequalities, we generate two new inequalities by combining or “mixing” them. We show that the new inequalities are strong in the sense that they fully describe the convex hull of a special mixed-integer region associated with the base inequalities.?We discuss how the mixing procedure can be used to obtain new classes of strong valid inequalities for various mixed-integer programming problems. In particular, we present examples for production planning, capacitated facility location, capacitated network design, and multiple knapsack problems. We also present preliminary computational results using the mixing procedure to tighten the formulation of some difficult integer programs. Finally we study some extensions of this mixing procedure. Received: April 1998 / Accepted: January 2001?Published online April 12, 2001     

Generating Convex Polynomial Inequalities for Mixed 0–1 Programs

We develop a method for generating valid convex quadratic inequalities for mixed0–1 convex programs. We also show how these inequalities can be generated in the linear case by defining cut generation problems using a projection cone. The basic results for quadratic inequalities are extended to generate convex polynomial inequalities.     

Weighted Variational Inequalities

In this paper, we introduce weighted variational inequalities over product of sets and system of weighted variational inequalities. It is noted that the weighted variational inequality problem over product of sets and the problem of system of weighted variational inequalities are equivalent. We give a relationship between system of weighted variational inequalities and systems of vector variational inequalities. We define several kinds of weighted monotonicities and establish several existence results for the solution of the above-mentioned problems under these weighted monotonicities. We introduce also the weighted generalized variational inequalities over product of sets, that is, weighted variational inequalities for multivalued maps and systems of weighted generalized variational inequalities. Extensions of weighted monotonicities for multivalued maps are also considered. The existence of a solution of weighted generalized variational inequalities over product of sets is also studied. The existence results for a solution of weighted generalized variational inequality problem give also the existence of solutions of systems of generalized vector variational inequalities. The first and third author express their thanks to the Department of Mathematical Sciences, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia for providing excellent research facilities. The authors are also grateful to the referees for comments and suggestions improving the final draft of this paper.     

Orlicz-Sobolev inequalities for sub-Gaussian measures and ergodicity of Markov semi-groups

We study coercive inequalities in Orlicz spaces associated to the probability measures on finite- and infinite-dimensional spaces which tails decay slower than the Gaussian ones. We provide necessary and sufficient criteria for such inequalities to hold and discuss relations between various classes of inequalities.     

Lifted flow cover inequalities for mixed 0-1 integer programs

We investigate strong inequalities for mixed 0-1 integer programs derived from flow cover inequalities. Flow cover inequalities are usually not facet defining and need to be lifted to obtain stronger inequalities. However, because of the sequential nature of the standard lifting techniques and the complexity of the optimization problems that have to be solved to obtain lifting coefficients, lifting of flow cover inequalities is computationally very demanding. We present a computationally efficient way to lift flow cover inequalities based on sequence independent lifting techniques and give computational results that show the effectiveness of our lifting procedures. Received May 15, 1996 / Revised version received August 7, 1998 Published online June 28, 1999     

Ramsey theory and integrality gap for the independent set problem

We discuss the effectiveness of integer programming for solving large instances of the independent set problem. Typical LP formulations, even strengthened by clique inequalities, yield poor bounds for this problem. We show that a strong bound can be obtained by the use of the so-called rank inequalities, which generalize the clique inequalities. For some problems the clique inequalities imply the rank inequalities, and then a strong bound is guaranteed already by the simpler formulation.     

The correlation bell inequalities

We consider the Bell and Bell-Clauser-Horne-Shimony-Holt inequalities for two-particle spin states. It is known that these inequalities are violated in experimental verification. We show that this can be explained because these inequalities are proved for correlation functions of random variables that are totally unrelated to one another, while the verification is done using correlation functions in which random variables refer to a pair of particles forming a two-particle state. In the case of entangled states, these random functions are dependent, and their correlation coefficient is nonzero. We give inequalities that explicitly involve this correlation coefficient. For factorable and separable states, these inequalities coincide with the standard Bell and Bell-Clauser-Horne-Shimony-Holt inequalities. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 158, No. 2, pp. 234–249, February, 2009.     

Pointwise symmetrization inequalities for Sobolev functions and applications

We develop a technique to obtain new symmetrization inequalities that provide a unified framework to study Sobolev inequalities, concentration inequalities and sharp integrability of solutions of elliptic equations.     

Valid inequalities based on the interpolation procedure

We study the interpolation procedure of Gomory and Johnson (1972), which generates cutting planes for general integer programs from facets of cyclic group polyhedra. This idea has recently been re-considered by Evans (2002) and Gomory, Johnson and Evans (2003). We compare inequalities generated by this procedure with mixed-integer rounding (MIR) based inequalities discussed in Dash and Gunluk (2003). We first analyze and extend the shooting experiment described in Gomory, Johnson and Evans. We show that MIR based inequalities dominate inequalities generated by the interpolation procedure in some important cases. We also show that the Gomory mixed-integer cut is likely to dominate any inequality generated by the interpolation procedure in a certain probabilistic sense. We also generalize a result of Cornuéjols, Li and Vandenbussche (2003) on comparing the strength of the Gomory mixed-integer cut with related inequalities.     

Projection iterative methods for solving some systems of general nonconvex variational inequalities

In this article, we introduce and consider a new system of general nonconvex variational inequalities involving four different operators. We use the projection operator technique to establish the equivalence between the system of general nonconvex variational inequalities and the fixed points problem. This alternative equivalent formulation is used to suggest and analyse some new explicit iterative methods for this system of nonconvex variational inequalities. We also study the convergence analysis of the new iterative method under certain mild conditions. Since this new system includes the system of nonconvex variational inequalities, variational inequalities and related optimization problems as special cases, results obtained in this article continue to hold for these problems. Our results can be viewed as a refinement and an improvement of the previously known results for variational inequalities.     

Iterative Methods for General Mixed Quasivariational Inequalities

It is well known that mixed quasivariational inequalities are equivalent to implicit fixed-point problems. We use this alternative equivalent formulation to suggest and analyze a new self-adaptive resolvent method for solving mixed quasivariational inequalities in conjunction with a technique updating the solution. We show that the convergence of this method requires pseudomonotonicity, which is a weaker condition than monotonicity. Since mixed quasivariational inequalities include various classes of variational inequalities as special cases, our results continue to hold for these problems.     

On mixing sets arising in chance-constrained programming

The mixing set with a knapsack constraint arises in deterministic equivalent of chance-constrained programming problems with finite discrete distributions. We first consider the case that the chance-constrained program has equal probabilities for each scenario. We study the resulting mixing set with a cardinality constraint and propose facet-defining inequalities that subsume known explicit inequalities for this set. We extend these inequalities to obtain valid inequalities for the mixing set with a knapsack constraint. In addition, we propose a compact extended reformulation (with polynomial number of variables and constraints) that characterizes a linear programming equivalent of a single chance constraint with equal scenario probabilities. We introduce a blending procedure to find valid inequalities for intersection of multiple mixing sets. We propose a polynomial-size extended formulation for the intersection of multiple mixing sets with a knapsack constraint that is stronger than the original mixing formulation. We also give a compact extended linear program for the intersection of multiple mixing sets and a cardinality constraint for a special case. We illustrate the effectiveness of the proposed inequalities in our computational experiments with probabilistic lot-sizing problems.