This paper examines the problems in the definition of the General Non-Parametric Corporate Performance (GNCP) and introduces a multiplicative linear programming as an alternative model for corporate performance. We verified and tested a statistically significant difference between the two models based on the application of 27 UK industries using six performance ratios. Our new model is found to...

Recently the author introduced a semidefinite upper bound on the square of the stability number of a graph, the inverse theta number, which is proved here to be multiplicative with respect to the strong graph product, hence to be an upper bound for the square of the Shannon capacity of the graph. We also describe a heuristic algorithm for the stable set problem based on semidefinite programming...

In this work we propose an outcome space approach for globally solving generalized concave multiplicative problems, a special class of nonconvex problems which involves the maximization of a finite sum of products of concave functions over a nonempty compact convex set. It is shown that this nonconvex maximization problem can be reformulated as an indefinite quadratic problem with infinitely ma...

The priority method of interval fuzzy preference relation is studied. A linear programming(LP) model based on multiplicative transitivity is constructed to derive interval weights from consistent or inconsistent interval fuzzy preference relation. By solving only one LP model, the proposed method can get the interval weights from an interval fuzzy preference relation, which can reduce the amoun...

Focalization property is a deep outcome of linear logic proof theory, putting to the foreground the role of polarity in logic. It resulted an important advances in various fields, ranging from linear logic programming to game theoretical analysis of linear logic proofs. The aim of this article is to propose an algebraic study of focalization property for the multiplicative-additive fragment of ...

According to the Erdős discrepancy conjecture, for any infinite ±1 sequence, there exists a homogeneous arithmetic progression of unbounded discrepancy. In other words, for any ±1 sequence (x1, x2, ...) and a discrepancy C, there exist integers m and d such that | ∑ m i=1 xi·d| > C. This is an 80-year-old open problem and recent development proved that this conjecture is true for discrepancies ...

We consider stochastic discrete-time systems with multiplicative noise which are controlled by dynamic output feedback and subjected to blockdiagonal stochastic parameter perturbations. Stability radii for these systems are characterized via scaling techniques and it is shown that for real data, the real and the complex stability radii coincide. In a second part of the paper we investigate the ...

I In this paper, we propose an algorithm base on decomposition technique for solving the mixed integer linear multiplicative-linear bilevel problems. In fact, this algorithm is an application of the algorithm given by G. K. Saharidis et al for the case in which the first level objective function is linear multiplicative. We use properties of quasi-concave of bilevel programming problems and dec...

Factored Edge-Valued Binary Decision Diagrams form an extension to Edge-Valued Binary Decision Diagrams. By associating both an additive and a multiplicative weight with the edges, FEVBDDs can be used to represent a wider range of functions concisely. As a result, the computational complexity for certain operations can be significantly reduced compared to EVBDDs. Additionally, the introduction ...

This paper proposes a passive fuzzy controller design for the discrete ship steering system that is represented by the Takagi-Sugeno (T-S) fuzzy model with multiplicative noises. Applying the Lyapunov theory for guaranteeing mean square stability, the sufficient conditions are developed to design the fuzzy controller for the T-S fuzzy model with multiplicative noises. The sufficient conditions ...