This paper presents a branch-and-bound algorithm for globally solving a wide class of generalized linear fractional programming problems (GLFP). This class includes such problems as: minimizing a sum, or error for product of a finite number of ratios of linear functions, linear multiplicative programming, polynomial programming, etc. – over nonconvex feasible region. First a problem (Q) is deri...

Abstract The aim of this paper is to prove some new fixed point results for a pair multivalued dominated locally contractive mappings in b -multiplicative metric space. Further, theorems multigraph-dominated are also established. Some on closed ball obtained endowed with graphic structure An illustrative example given show the validity hypothesis our result. Moreover, applications coupled syste...

In this paper, we propose an extension of the so-called Iri-Imai method to solve constrained convex programming problems. The original Iri-Imai method is designed for linear programs and assumes that the optimal objective value of the optimization problem is known in advance. Zhang [18] extends the method for constrained convex optimization, but the optimum value is still assumed to be known in...

The training of support vector machines (SVM) involves a quadratic programming problem, which is often optimized by a complicated numerical solver. In this paper, we propose a much simpler approach based on multiplicative updates. This idea was first explored in [Cristianini et al., 1999], but its convergence is sensitive to a learning rate that has to be fixed manually. Moreover, the update ru...

‎The first multiplicative Zagreb index $Pi_1(G)$ is equal to the‎ ‎product of squares of the degree of the vertices and the second‎ ‎multiplicative Zagreb index $Pi_2(G)$ is equal to the product of‎ ‎the products of the degree of pairs of adjacent vertices of the‎ ‎underlying molecular graphs $G$‎. ‎Also‎, ‎the multiplicative sum Zagreb index $Pi_3(G)$ is equal to the product of‎ ‎the sum...

background: for psychiatric disorders, comorbidity is a rule rather than exception. thus it is particularly important to study additive and multiplicative effects of multiple mental disorders on suicidal behaviors. objectives: the aim of this study was to investigate the ethnic differences in multiplicative effects of mental disorders on suicidal ideation among black adults in the united states...

for fr$acute{mathbf{text{e}}}$chet algebras $(a, (p_n))$ and $(b, (q_n))$, a linear map $t:arightarrow b$ is textit{almost multiplicative} with respect to $(p_n)$ and $(q_n)$, if there exists $varepsilongeq 0$ such that $q_n(tab - ta tb)leq varepsilon p_n(a) p_n(b),$ for all $n in mathbb{n}$, $a, b in a$, and it is called textit{weakly almost multiplicative} with respect to $(p_n)$ and $(q_n)$,...

We prove that a class of stochastic differential equations with multiplicative noise has a unique solution in a noncommutative L2 space associated with a von Neumann algebra. As examples we consider usual L2 on a measure space, Hilbert-Schmidt operators and a hyperfinite II1-factor. A problem of finding an inverse of the solution is then discussed. Finally, we explain how a stochastic different...

Binary search trees are one of the oldest and most common dictionary data structures. The most common implementation of a binary tree uses two pointers in each node to point to the children. This representation however suffers from significant multiplicative overhead for storage of data. Each datum incurs an overhead of two pointers. In common programming languages, where each node is represent...