Arithmetic-geometric Inequality Research Articles

Sublinear Circuits for Polyhedral Sets

Sublinear circuits are generalizations of the affine circuits in matroid theory, and they arise as the convex-combinatorial core underlying constrained non-negativity certificates of exponential sums and of polynomials based on the arithmetic-geometric inequality. Here, we study the polyhedral combinatorics of sublinear circuits for polyhedral constraint sets. We give results on the relation between the sublinear circuits and their supports and provide necessary as well as sufficient criteria for sublinear circuits. Based on these characterizations, we provide some explicit results and enumerations for two prominent polyhedral cases, namely the non-negative orthant and the cube [− 1,1]n.

A note on mediated simplices

Many homogeneous polynomials that arise in the study of sums of squares and Hilbert's 17th problem are those formed by monomial substitutions into the arithmetic-geometric inequality. In 1989, Reznick [14] gave a necessary and sufficient condition for such a form to have a representation as a sum of squares of forms, involving the arrangement of lattice points in the simplex whose vertices were the n -tuples of the exponents used in the substitution. Further, a claim was made, and not proven, that sufficiently large dilations of any such simplex will also satisfy this condition. The aim of this short note is to prove the claim, and provide further context for the result, both in the study of Hilbert's 17th Problem and the study of lattice point simplices.

The {mathcal {S}}-cone and a primal-dual view on second-order representability

The {mathcal {S}}-cone provides a common framework for cones of polynomials or exponential sums which establish non-negativity upon the arithmetic-geometric inequality, in particular for sums of non-negative circuit polynomials (SONC) or sums of arithmetic-geometric exponentials (SAGE). In this paper, we study the {mathcal {S}}-cone and its dual from the viewpoint of second-order representability. Extending results of Averkov and of Wang and Magron on the primal SONC cone, we provide explicit generalized second-order descriptions for rational {mathcal {S}}-cones and their duals.

Operator inequalities involving the arithmetic, geometric, Heinz and Heron means

In this paper we present two improved arithmetic-geometric inequalities with Kan- torovich constant (Lemma 3 and Lemma 5), based on which we provide some refinements in the operator case and then finally refer to the operator inequalities involving Heinz and Heron means.

Optimal economic order quantity for buyer–distributor–vendor supply chain with backlogging derived without derivatives

In this article, we first complement an inappropriate mathematical error on the total cost in the previously published paper by Chung and Wee [2007, ‘Optimal the Economic Lot Size of a Three-stage Supply Chain With Backlogging Derived Without Derivatives’, European Journal of Operational Research, 183, 933–943] related to buyer–distributor–vendor three-stage supply chain with backlogging derived without derivatives. Then, an arithmetic–geometric inequality method is proposed not only to simplify the algebraic method of completing prefect squares, but also to complement their shortcomings. In addition, we provide a closed-form solution to integral number of deliveries for the distributor and the vendor without using complex derivatives. Furthermore, our method can solve many cases in which their method cannot, because they did not consider that a squared root of a negative number does not exist. Finally, we use some numerical examples to show that our proposed optimal solution is cheaper to operate than theirs.

Solving the vendor–buyer integrated inventory system with arithmetic–geometric inequality

In the past, economic order quantity (EOQ) and economic production quantity (EPQ) were treated independently from the viewpoints of the buyer or the vendor. In most cases, the optimal solution for one player was non-optimal to the other player. In today’s competitive markets, close cooperation between the vendor and the buyer is necessary to reduce the joint inventory cost and the response time of the vendor–buyer system. The successful experiences of National Semiconductor, Wal-Mart, and Procter and Gamble have demonstrated that integrating the supply chain has significantly influenced the company’s performance and market share (Simchi-Levi et al. (2000) [1]). Recently, Yang et al. (2007) [2] presented an inventory model to determine the economic lot size for both the vendor and buyer, and the number of deliveries in an integrated two stage supply chain. In this paper, we present an alternative approach to determine the global optimal inventory policy for the vendor–buyer integrated system using arithmetic–geometric inequality.

Comment on ‘Optimal inventory replenishment policy for the EPQ model under trade credit derived without derivatives’

In this article, we complement the shortcoming of the inventory economic production quantity (EPQ) model developed by Huang and Huang (2008), ‘Optimal Inventory Replenishment Policy for the EPQ Model Under Trade Credit Derived Without Derivatives’, International Journal of Systems Science, 39, 539–546), and propose an arithmetic–geometric inequality method to obtain the global optimal solution without taking complex differential calculus or using tedious algebraic manipulations. Finally, we provide an economical interpretation of the theoretical result so that the reader can understand the insight of the result.

NOTE: A Short Proof of Ky Fan's Arithmetic-Geometric Inequality

NOTE: A Short Proof of Ky Fan's Arithmetic-Geometric Inequality

Forms derived from the arithmetic-geometric inequality

Forms derived from the arithmetic-geometric inequality

A quantitative version of Hurwitz' theorem on the arithmetic-geometric inequality.

Article A quantitative version of Hurwitz' theorem on the arithmetic-geometric inequality. was published on January 1, 1987 in the journal Journal für die reine und angewandte Mathematik (volume 1987, issue 377).

A penalty treatment of equality constraints in generalized geometric programming

A technique is described for solving generalized geometric programs whose constraints include one or more strict equalities. The algorithm solves a sequence of penalized geometric programs; the penalty functions are derived from the arithmetic-geometric inequality as condensed posynomials. Two examples serve to illustrate the idea.