一个代数不等式与一类几何不等式的指数推广

本文介绍一个代数不等式,应用它直接将一类常见的几何不等式进行指数推广．定理若ａ,ｂ,ｃ∈Ｒ＋,ｎ∈Ｎ且ｎ≥２,则ａｎ＋ｂｎ＋ｃｎ３≥（ａ＋ｂ＋ｃ３）ｎ（＊）当且仅当ａ＝ｂ＝ｃ时等号成立．证当ｎ＝２时,∵ａ２＋ｂ２＋ｃ２３－（ａ＋ｂ＋ｃ３）２＝（ａ－ｂ...     

矩不等式在证明不等式中的应用

本文给出了有关矩的一些不等式在证明不等式中的应用。方法独特，简捷。     

刘徽不等式与祖冲之不等式的注记

利用微分学方法给出刘徽不等式与祖冲之不等式的证明;得到两个关于双曲函数的不等式;还得到两个关于单位圆内接正n边形周长与π之间关系的不等式.     

一些Pachpatte不等式的加强与反向形式

本文建立了一些新的加强和反向Pachpatte不等式.作为应用,推广和加强了一些新型Hilbert不等式.     

一个积和不等式猜想

介绍一个积和不等式猜想,对任意的正整数n和α∈[0,1],有n-1∑k=0[(n-k)~(a-1)-(n-k+1)~(a-1)][(k+1)~(1-a)-k~(1-a)]≤(n+1)~(1-a)-n~(1-a).证明对于另外,证明与猜想相近的结论.对任意的正整数n和α∈[0,1],有n-1∑k=0[(n-k)~(a-1)-(n-k+1)~(a-1)][(k+1)~(1-a)-k~(1-a)]≤(n+1)~(1-a)-n~(1-a)+(a(2-2~(a-1)))/n~a-1/(n+1)成立.     

某些新解析不等式和不等式常数改进的实际用处

本文建立一般不等式,推广了Hardy-Littlewood、Polya和Mitrinovic-Adamovic不等式,文中给出在抛射体(导弹)和火箭上的二个实际用处.Bellman说:“存在研究不等式的三个理由;实际的理论的和美学的.”我们构造抛射体(导弹)在真空中的弹着点(或水平射程)不等式.改进这不等式常数对战争的胜利有所帮助.在书[2][3]中证明了:     

权方和不等式的推广及其应用

权方和不等式的推广及其应用徐幼明（湖北浠水师范学校４３６２００）权方和不等式∑ａｑ＋１ｉｂｑｉ≥（∑ａｉ）ｑ＋１∑ｂｑｉ①（ｑ∈Ｎ）是湖南杨克昌先生在文［１］中首次提出的一个重要不等式，其应用之广泛已为不少专文所介绍．本文从改善不等式成立的条件入手，...     

用平均不等式证明不等式的思路

平均不等式ａ2 ｂ2 ≥ 2ａｂ ( 1)(ａ ,ｂ∈Ｒ ,当且仅当ａ =ｂ时取等号 )及　　　　ａ3 ｂ3 ｃ3 ≥ 3ａｂｃ ( 2 )(ａ ,ｂ ,ｃ∈Ｒ ,当且仅当ａ =ｂ =ｃ时取等号 )是证明不等式的重要工具 ,怎样熟练灵活运用它们证明不等式是学习中的难点 .实际上 ,灵活运用上述公式可从平均不等式与待证不等式的特征入手 .1　升降次数例 1　设ａ ,ｂ ,ｃ∈Ｒ ,且ａｂｃ =1,求证ａ3 ｂ3 ｃ3 ≥ａ ｂ ｃ .分析 :两个平均不等式对单个字母而言从左到右是起降次作用 ,注意到要证的不等式正具有此特点且ａ =ｂ =ｃ =1时两边相等 ,因而有下面的证法 .证　…     

两个优美不等式的推广

本刊文[1]介绍了一组俄罗斯杂志《中学数学》刊登的不等式题，其中有下面的瓦西列夫不等式和彼得罗夫不等式：     

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.     

Operator-norm inequalities and interpolated trace inequalities

In this article, we investigate some operator-norm inequalities related to some conjectures posed by Hayajneh and Kittaneh that are related to questions of Bourin regarding a special type of inequalities referred to as subadditivity inequalities. While some inequalities are meant to answer these conjectures, other inequalities present reverse-type inequalities for these conjectures. Then, we present some new trace inequalities related to Heinz means inequality and use these inequalities to prove some variants of the aforementioned conjectures.     

Functional inequalities for the Wright functions

In this paper, our aim is to show some mean value inequalities for the Wright function, such as Turán-type inequalities, Lazarevi?-type inequalities, Wilker-type inequalities and Redheffer-type inequalities. Moreover, we prove monotonicity of ratios for sections of series of Wright functions, the result is also closely connected with Turán-type inequalities. In the end of the paper, we present some other inequalities for the Wright function.     

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.     

Hemivariational-like inequalities

In this paper, we introduce and consider a new class of variational inequalities, known as the hemivariational-like inequalities. It is shown that the hemivariational-like inequalities include hemivariational inequalities, variational-like inequalities and the classical variational inequalities as special cases. The auxiliary principle is used to suggest and analyze some iterative methods for solving hemivariational-like inequalities under mild conditions. The results obtained in this paper can be considered as a novel application of the auxiliary principle technique.     

Projection Method Approach for General Regularized Non-convex Variational Inequalities

In this paper, we investigate or analyze non-convex variational inequalities and general non-convex variational inequalities. Two new classes of non-convex variational inequalities, named regularized non-convex variational inequalities and general regularized non-convex variational inequalities, are introduced, and the equivalence between these two classes of non-convex variational inequalities and the fixed point problems are established. A projection iterative method to approximate the solutions of general regularized non-convex variational inequalities is suggested. Meanwhile, the existence and uniqueness of solution for general regularized non-convex variational inequalities is proved, and the convergence analysis of the proposed iterative algorithm under certain conditions is studied.     

Gap inequalities for non-convex mixed-integer quadratic programs

Laurent and Poljak introduced a very general class of valid linear inequalities, called gap inequalities, for the max-cut problem. We show that an analogous class of inequalities can be defined for general non-convex mixed-integer quadratic programs. These inequalities dominate some inequalities arising from a natural semidefinite relaxation.     

Capacitated facility location: Separation algorithms and computational experience

We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack cover, flow cover, effective capacity, single depot, and combinatorial inequalities. The flow cover, effective capacity and single depot inequalities form subfamilies of the general family of submodular inequalities. The separation problem based on the family of submodular inequalities is NP-hard in general. For the well known subclass of flow cover inequalities, however, we show that if the client set is fixed, and if all capacities are equal, then the separation problem can be solved in polynomial time. For the flow cover inequalities based on an arbitrary client set and general capacities, and for the effective capacity and single depot inequalities we develop separation heuristics. An important part of these heuristics is based on the result that two specific conditions are necessary for the effective cover inequalities to be facet defining. The way these results are stated indicates precisely how structures that violate the two conditions can be modified to produce stronger inequalities. The family of combinatorial inequalities was originally developed for the uncapacitated facility location problem, but is also valid for the capacitated problem. No computational experience using the combinatorial inequalities has been reported so far. Here we suggest how partial output from the heuristic identifying violated submodular inequalities can be used as input to a heuristic identifying violated combinatorial inequalities. We report on computational results from solving 60 medium size problems. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.     

Merit functions for general variational inequalities

In this paper, we consider some classes of merit functions for general variational inequalities. Using these functions, we obtain error bounds for the solution of general variational inequalities under some mild conditions. Since the general variational inequalities include variational inequalities, quasivariational inequalities and complementarity problems as special cases, results proved in this paper hold for these problems. In this respect, results obtained in this paper represent a refinement of previously known results for classical variational inequalities.