نتایج جستجو برای: upper bound method

تعداد نتایج: 1945862  

Several methods have been proposed for ranking the decision-making units (DMUs) in data envelopment analysis (DEA) with imprecise data. Some methods have only used the upper bound efficiencies to rank DMUs. However, some other methods have considered both of the lower and upper bound efficiencies to rank DMUs. The current paper shows that these methods did not consider the DEA axioms and may be...

In this paper, we apply Legendre wavelet collocation method to obtain the approximate solution of nonlinear Stratonovich Volterra integral equations. The main advantage of this method is that Legendre wavelet has orthogonality property and therefore coefficients of expansion are easily calculated. By using this method, the solution of nonlinear Stratonovich Volterra integral equation reduces to...

1999
Kai Zhang Tsuyoshi Shinogi Haruhiko Takase Terumine Hayashi

This paper presents a method for evaluating an upper bound of simultaneous switching gates in combinational circuits. In this method, the original circuit is partitioned into subcircuits, and the upper bound is approximately computed as the sum of maximum switching gates for all subcircuits. In order to increase the accuracy, we adopted an evaluation function that takes account of both the inte...

2011
Tomonari Kitahara Tomomi Matsui Shinji Mizuno

We give an upper bound for the number of different basic feasible solutions generated by Dantzig’s simplex method (the simplex method with the most negative pivoting rule) for LP with bounded variables by extending the result of Kitahara and Mizuno (2010). We refine the analysis by them and improve an upper bound for a standard form of LP. Then we utilize the improved bound for an LP with bound...

2008
David J. Aldous Tamar Lando

xxx Working notes. Three main things remain to do. (1) Either include Tamar’s argument [now in separate document] for Theorem 5, or replace by some better construction for worst-case upper bound. (2) Put in the average-case lower bound calculus calculations needed in section 6. (3) General version of the worst-case lower bound method in section 7.3. A fourth thing one might contemplate: (4) Is ...

Azar Niknam Jafar Bagherinejad

In this paper, a leader–follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services ar...

D. Behmardii S. Sedaghatiii Y. Ordokhaniii

In this paper, the problem of delay dependent robust asymptotically stable for uncertain linear time-variant system with multiple delays is investigated. A new delay-dependent stability sufficient condition is given by using the Lyapunov method, linear matrix inequality (LMI), parameterized first-order model transformation technique and transformation of the interval uncertainty in to the norm ...

Habibe Sadeghi Leila Karimi

In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید