Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 8

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  convex
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
EN
The median location problem concerns finding locations of one or several new facilities that minimize the overall weighted distances from the existing to the new facilities. We address the problem of locating one new facility with a radius r on networks. Furthermore, the radius r is flexible and the objective function is the conic combination of the traditional 1-median function and the value r. We call this problem an extensive 1-median problem with radius on networks. To solve the problem, we first induce the so-called finite dominating set, that contains all points on the underlying network and radius values which are candidate for the optimal solution of the problem. This helps to develop a combinatorial algorithm that solves the problem on a general network G = (V,E) in O(|E||V |3) time. We also consider the underlying problem with improved algorithm on trees. Based the convexity of the objective function with variable radius, we develop a linear time algorithm to find an extensive 1-median with radius on the underlying tree.
2
Content available remote A note on q-calculus
EN
In this article, we let PCq denote the class of q—convex functions. Certain analytic properties of the class PCq are studied. The maximum of the absolute value of the Fekete-Szegö functional is briefly determined.
EN
In the paper, we introduce a generalized class of k-starlike functions associated with Wright generalized hypergeometric functions and obtain the sequential subordination results and integral means inequalities. Some interesting consequences of our results are also pointed out.
5
Content available remote Integral representations of convex and concave set-valued functions
EN
We will denote by C+ the family of all convex set-valued functions F denned on [a, b} with nonempty compact values, continuous at a, for which there exist all differences F(t) - F(s) as far as a < s < t < b. The main purpose oh this paper is to show that a function F belongs to the family C+ if and only if it is of the form t F(t)=F(a)+^\G(x)dx a for some decreasing set-valued function G.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.