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

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

In this article we introduce and study the concept of characteristic degree of a subgroup in a finite group. We define the characteristic degree of a subgroup H in a finite group G as the ratio of the number of all pairs (h,α) ∈ H×Aut(G) such that h^α∈H, by the order of H × Aut(G), where Aut(G) is the automorphisms group of G. This quantity measures the probability that H can be characteristic ...

Journal: :روش های عددی در مهندسی (استقلال) 0
فریماه مخاطب رفیعی و محمد معطر حسینی f. mokhatab-rafiei and m. moattar hosaini

this paper considers the economic lot scheduling problem, that is, the problem of scheduling several products on a single facility so as to minimize holding and setup costs. combination of frequency and timing as well as production quantity make this problem np-hard. a heuristic is developed to obtain a good solution to elsp. the proposed heuristic makes use of the simulated annealing technique...

Journal: :Discrete & Computational Geometry 1993
William Jockusch

We construct a family of cubical polytypes which shows that the upper bound on the number of facets of a cubical polytope (given a fixed number of vertices) is higher than previously suspected. We also formulate a lower bound conjecture for cubical polytopes.

Journal: :journal of sciences, islamic republic of iran 2011
r. lashkaripour

let = be a non-negative matrix. denote by the supremum of those , satisfying the following inequality: where , , and also is increasing, non-negative sequence of real numbers. if we used instead of the purpose of this paper is to establish a hardy type formula for , where is hausdorff matrix and a similar result is also established for where in particular, we apply our results to the cesaro...

2017
Christian M Sperber Suren R Samarasinghe Grace P Lomax

BACKGROUND The Medication Possession Ratio (MPR) is a ubiquitous and central measurement for adherence in the health care industry. However, attempts to standardize its calculation have failed, possibly due to the opacity of a single, static MPR, incapability of directly lending itself to a variety of studies, and challenges of comparing the value across studies. This work shows that the MPR st...

G. Moslehi and M. Mahnam,

While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...

Journal: :bulletin of the iranian mathematical society 2015
m. s. asgari z. badehian

‎in this paper‎, ‎we introduce $alpha$-$psi$-contractive mapping in partially ordered sets and construct fixed point theorems to solve a first-order ordinary differential equation by existence of its lower solution.

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شهید مدنی آذربایجان - دانشکده علوم پایه 1392

let g=(v,e) be a graph with vertex set v and edge set e.for two vertices u,v of g ,the closed interval i[u,v] ,consists of u,v and all vertices lying in some u-v geodesic in g.if s is a set of vertices of g then i[s]is the union of all sets i[u,v]for u,v ? s. if i[s]=v(g) , then s is a geodetic set for g.the geodetic number g(g) is the minimum cardinality of geodetic set.the maximum cardinalit...

Journal: :iranian journal of mathematical chemistry 2015
m. a. iranmanesh m. saheli

the harmonic index h(g) , of a graph g is defined as the sum of weights 2/(deg(u)+deg(v)) of all edges in e(g), where deg (u) denotes the degree of a vertex u in v(g). in this paper we define the harmonic polynomial of g. we present explicit formula for the values of harmonic polynomial for several families of specific graphs and we find the lower and upper bound for harmonic index in caterpill...

F. Mokhatab-Rafiei and M. Moattar Hosaini,

This paper considers the Economic Lot Scheduling Problem, that is, the problem of scheduling several products on a single facility so as to minimize holding and setup costs. Combination of frequency and timing as well as production quantity make this problem Np-hard. A heuristic is developed to obtain a good solution to ELSP. The proposed heuristic makes use of the Simulated Annealing Technique...

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

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