31 resultados para Weighted summation inequalities

em Bulgarian Digital Mathematics Library at IMI-BAS


Relevância:

30.00% 30.00%

Publicador:

Resumo:

MSC 2010: 30A10, 30B10, 30B30, 30B50, 30D15, 33E12

Relevância:

20.00% 20.00%

Publicador:

Resumo:

∗ The final version of this paper was sent to the editor when the author was supported by an ARC Small Grant of Dr. E. Tarafdar.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The generalized Wiener-Hopf equation and the approximation methods are used to propose a perturbed iterative method to compute the solutions of a general class of nonlinear variational inequalities.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper develops the results announced in the Note [14]. Using an eigenvalue problem governed by a variational inequality, we try to unify the theory concerning the post-critical equilibrium state of a thin elastic plate subjected to unilateral conditions.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

* This work was completed while the author was visiting the University of Limoges. Support from the laboratoire “Analyse non-linéaire et Optimisation” is gratefully acknowledged.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Reproducing Kernel Hilbert Space (RKHS) and Reproducing Transformation Methods for Series Summation that allow analytically obtaining alternative representations for series in the finite form are developed.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider an uncertain version of the scheduling problem to sequence set of jobs J on a single machine with minimizing the weighted total flow time, provided that processing time of a job can take on any real value from the given closed interval. It is assumed that job processing time is unknown random variable before the actual occurrence of this time, where probability distribution of such a variable between the given lower and upper bounds is unknown before scheduling. We develop the dominance relations on a set of jobs J. The necessary and sufficient conditions for a job domination may be tested in polynomial time of the number n = |J| of jobs. If there is no a domination within some subset of set J, heuristic procedure to minimize the weighted total flow time is used for sequencing the jobs from such a subset. The computational experiments for randomly generated single-machine scheduling problems with n ≤ 700 show that the developed dominance relations are quite helpful in minimizing the weighted total flow time of n jobs with uncertain processing times.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mathematics Subject Classification: 42B35, 35L35, 35K35

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mathematics Subject Classification: 26A16, 26A33, 46E15.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mathematics Subject Classification: 26D10.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 26A33, 33C60, 44A15, 35K55

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mathematics Subject Classification: 47A56, 47A57,47A63

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Some new nonlinear integral inequalities that involve the maximum of the unknown scalar function of one variable are solved. The considered inequalities are generalizations of the classical nonlinear integral inequality of Bihari. The importance of these integral inequalities is defined by their wide applications in qualitative investigations of differential equations with "maxima" and it is illustrated by some direct applications.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

MSC 2010: 26A33

Relevância:

20.00% 20.00%

Publicador:

Resumo:

ACM Computing Classification System (1998): I.2.8, I.2.10, I.5.1, J.2.