In this short paper, we give an upper bound for the number of different basic feasible solutions generated by the dual simplex method with the most negative pivoting rule for LP. The bound is comparable with the bound given by Kitahara and Mizuno (2010) for the primal simplex method. We apply the result to the maximum flow problem and get a strong polynomial bound.

In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.

In this paper, we study (Q > x), the tail of the steady-state queue length distribution at a high-speed multiplexer. In particular, we focus on the case when the aggregate traffic to the multiplexer can be characterized by a stationary Gaussian process. We provide two asymptotic upper bounds for the tail probability and an asymptotic result that emphasizes the importance of the dominant time sc...

Abstract-This paper deals with the problem of persistent bounded disturbance rejection for uncertain neutral delay systems. Using Lyapunov-Krasovskii functional method, we establish sufficient conditions in terms of linear matrix inequality (LMI) that simultaneously ensure ρ-performance and stability (delay-dependent and delay-independent). Particulary, for the delay-dependent case, an estimati...

The problem of the slow viscous flow of a fluid through a random porous medium is considered. The macroscopic Darcy’s law, which defines the fluid permeability k, is first derived in an ensemble-average formulation using the method of homogenization. The fluid permeability is given explicitly in terms of a random boundary-value problem. General variational principles, different to ones suggeste...

Here admissible means that none of the n points is sent to infinity by the projective transformation. For dimension two and three the numbers f (d) are known: f (2) = 5 and f (3) = 7. For d ≥ 2, Larman has established in [6] the bounds 2d + 1 ≤ f (d) ≤ (d + 1)2, and conjectured that f (d) = 2d + 1. The upper bound has been improved to f (d) ≤ (d + 1)(d + 2)/2 by Las Vergnas [7], as a corollary ...

This paper studies the mean square exponential synchronization control of Markovian jump chaotic Lur'e systems (MJCLSs) with multiple time delays under aperiodic sampling. Firstly, by introducing mode-dependent single/double integral terms and considering system state at sampling instant, a new Lyapunov functional based on looped-functional is constructed. On basis constructed estimating expect...

Actual performance measurement systems do not only consider financial measures like costs and profits but also non-financial indicators with respect customer service, quality and flexibility. Using the newsvendor model we explore the influence of possibly conflicting performance measures on important operations decisions like the order quantity and the selling price of a product. For price-inde...

The paper reviews some of the existing exact bounds to the maximum clique of a graph and successively presents a new upper and a new lower bound. The new upper bound is !6 n − rank 1 A=2, where 1 A is the adjacency matrix of the complementary graph, and derives from a formulation of the maximum clique problem in complex space. The new lower bound is !¿ 1=(1− gj∗( ∗)) (see text for details) and ...