Strong valid inequalities for orthogonal disjunctions and bilinear covering sets

In this paper, we derive a closed-form characterization of the convex hull of a generic nonlinear set, when this convex hull is completely determined by orthogonal restrictions of the original set. Although the tools used in this construction include disjunctive programming and convex extensions, our characterization does not introduce additional variables. We develop and apply a toolbox of results to check the technical assumptions under which this convexification tool can be employed. We demonstrate its applicability in integer programming by providing an alternate derivation of the split cut for mixed-integer polyhedral sets and finding the convex hull of certain mixed/pure-integer bilinear sets. We then extend the utility of the convexification tool to relaxing nonconvex inequalities, which are not naturally disjunctive, by providing sufficient conditions for establishing the convex extension property over the non-negative orthant. We illustrate the utility of this result by deriving the convex hull of a continuous bilinear covering set over the non-negative orthant. Although we illustrate our results primarily on bilinear covering sets, they also apply to more general polynomial covering sets for which they yield new tight relaxations.     

Bernstein-type inequalities for\mathcal{L}-splines

New Berhstein-type inequalities are obtain for 2-periodic -splines associated with a differential operator of degree r with fixed real coefficients.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 45, No. 1, pp. 10–20, January, 1993.     

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     

Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting

We study the mixed 0-1 knapsack polytope, which is defined by a single knapsack constraint that contains 0-1 and bounded continuous variables, through the lifting of continuous variables fixed at their upper bounds. We introduce the concept of a superlinear inequality and show that, in this case, lifting is significantly simpler than for general inequalities. We use the superlinearity theory, together with the traditional lifting of 0-1 variables, to describe families of facets of the mixed 0-1 knapsack polytope. Finally, we show that superlinearity results can be extended to nonsuperlinear inequalities when the coefficients of the variables fixed at their upper bounds are large.This research was supported by NSF grants DMI-0100020 and DMI-0121495Mathematics Subject Classification (1991): 90C11, 90C27     

On the rational recursive sequencex_{n + 1} = \frac{{\alpha x_n + \beta x_{n - 1} + \gamma x_{n - 2} + \delta x_{n - 3} }}{{Ax_n + Bx_{n - 1} + Cx_{n - 2} + Dx_{n - 3} }}

The main objective of this paper is to study the boundedness character, the periodic character and the global stability of the positive solutions of the following difference equation $x_{n + 1} = \frac{{\alpha x_n + \beta x_{n - 1} + \gamma x_{n - 2} + \delta x_{n - 3} }}{{Ax_n + Bx_{n - 1} + Cx_{n - 2} + Dx_{n - 3} }},n = 0,1,2.....$ where the coefficientsA, B, C, D, α, β, γ, δ, and the initial conditionsx _-3,x _-2,x _-1,x ₀ are arbitrary positive real numbers.     

Classifying ACM sets of points in $${\mathbb{P}^{1} \times \mathbb{P}^{1}}$$ via separators

The purpose of this note is to give a new, short proof of a classification of ACM sets of points in in terms of separators.     

Universal extrapolation spaces for \hbox {C}_{0}-semigroups

The classical theory of Sobolev towers allows for the construction of an infinite ascending chain of extrapolation spaces and an infinite descending chain of interpolation spaces associated with a given \(C_0\) -semigroup on a Banach space. In this note we first generalize the latter to the case of a strongly continuous and exponentially equicontinuous semigroup on a complete locally convex space. As a new concept—even for \(C_0\) -semigroups on Banach spaces—we then define a universal extrapolation space as the completion of the inductive limit of the ascending chain. Under mild assumptions we show that the semigroup extends to this space and that it is generated by an automorphism of the latter. Dually, we define a universal interpolation space as the projective limit of the descending chain. We show that the restriction of the initial semigroup to this space is again a semigroup and always has an automorphism as generator.     

Manifolds without \tfrac{1} {k} -geodesics

We will show that for any positive integer k, there exists a smooth manifold that has no -geodesic.     

Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms

We study the mixed 0-1 knapsack polytope, which is defined by a single knapsack constraint that contains 0-1 and bounded continuous variables. We develop a lifting theory for the continuous variables. In particular, we present a pseudo-polynomial algorithm for the sequential lifting of the continuous variables and we discuss its practical use.This research was supported by NSF grants DMI-0100020 and DMI-0121495Mathematics Subject Classification (2000): 90C11, 90C27     

On the Evaluation of the Integral $$\int_0^{{\pi \mathord{\left/ {\vphantom {\pi 4}} \right. \kern-\nulldelimiterspace} 4}} {\ln \left( {\cos ^{{m \mathord{\left/ {\vphantom {m n}} \right. \kern-\nulldelimiterspace} n}} \theta \pm \sin ^{{m \mathord{\left/ {\vphantom {m n}} \right. \kern-\nulldelimiterspace} n}} \theta } \right)d\theta } $$

The integral $$\int_0^{{\pi \mathord{\left/ {\vphantom {\pi 4}} \right. \kern-\nulldelimiterspace} 4}} {\ln \left( {\cos ^{{m \mathord{\left/ {\vphantom {m n}} \right. \kern-\nulldelimiterspace} n}} \theta \pm \sin ^{{m \mathord{\left/ {\vphantom {m n}} \right. \kern-\nulldelimiterspace} n}} \theta } \right)d\theta } $$ where m and n are relatively prime positive integers, is evaluated exactly in terms of elementary functions and the Catalan constant G.     

On the continued fraction \frac{1 |}{| z } +\frac{1 |}{| 1 } + \frac{2 |}{| z } +\frac{3 |}{| 1 } + \frac{4 |}{| z} + \cdots

The article on hand deals with the continued fraction $$\frac{1 |}{| z } +\frac{1 |}{| 1 } + \frac{2 |}{| z } +\frac{3 |}{| 1 } + \frac{4 |}{| z} + \cdots.$$ The famous Indian mathematician Srinivasa Ramanujan has given a pre-presentation by a power series, but he however concealed a proof. Subsequently a proof has been established, but a direct verification is intricate. Here we give a quick and direct approach with comparitively little effort.     

The estimate for mean values on prime numbers relative to \frac{4} {p} = \frac{1} {{n_1 }} + \frac{1} {{n_2 }} + \frac{1} {{n_3 }}

If n is a positive integer,let f （n） denote the number of positive integer solutions （n 1,n 2,n 3） of the Diophantine equation 4/n=1/n₁ + 1/n₂ + 1/n₃.For the prime number p,f （p） can be split into f 1 （p） + f 2 （p）,where f i （p） （i=1,2） counts those solutions with exactly i of denominators n 1,n 2,n 3 divisible by p.In this paper,we shall study the estimate for mean values ∑ p相似文献   

Measures and submeasures on $$\hbox {d}_{0}$$-algebras

The structure of \(\hbox {d}_{0}\)-algebra is a generalization of a D-lattice. We extend to this structure the definitions of measure and submeasure, and investigate their properties. We also investigate the relationships between uniformities and measures (or submeasures).     

On the Recursive Sequence x_{n + 1} = {{ \mgreek{g} x_{n-1} + \mgreek{d} x_{n-2}} \over {Cx_{n-1} + Dx_{n-2}}}

We investigate the global character of solutions of the equation in the title with positive parameters and positive initial conditions. We obtain results about the global attractivity of the equilibrium, the existence and attractivity of the period-two solution and the semicycles.