Sentence examples for efficiency interval from inspiring English sources

Efficiency interval of the lot i at the time e(n).

If it is not empty, then it comprises at least one connected region including its efficiency interval at the initial instant (as postulated from Section 3).

In this paper, we show by a numerical example that the bounded DEA models are incapable of determining an efficiency interval for any DMU when there is a zero value for each output.

Thus the collection of parking choice problems parameterized by ( tilde{x} ) amounts to a sequence of efficiency intervals: the sequence is ordered by the lot positions since a larger position induces an efficiency interval with larger values.

In the former case, at every ( tilde{t} ) the efficiency interval of i, ( {E}_ileft tilde{t}right) ), is an interval and there can be no point ( left tilde{x},tilde{t}right) ) outside of it where lot i would be efficient.

Denote N the number of nonempty efficiency intervals (the value of n at the end of the algorithm).

One intersection at ( {widehat{x}}_{ij} ) separates the respective efficiency intervals {g}_ileft({x}_j,tilde{t}right)<{V}_j,forall kern0.18em tilde{t},kern0.28emathrm{everywherem{e}.kern0.28em ikern0.28em mathrm{dominates}kern0.28em jkern0.28em mathrm{everywhere} (3.4a).

Open image in new window Fig. 2 Profit efficiency ranking interval of 14 hospitals.

The efficiency of interval estimation for LPV models is demonstrated through numerical experiments for a microfluidic system and an academic example.

In this paper, an orthogonal experiment was designed which was involved in four levels and five factors including the ultrasonic frequency and power efficiency, the interval between two stimulations, the each stimulation time, and the total ultrasonic stimulation duration.

To further improve the computational efficiency, the interval perturbation method (IPM) is used to estimate the constraints, thereby the calculation for the constraints in each optimization loop becomes deterministic, and the double-loop nested problem is reduced to an approximate single-loop problem.