Pairwise comparisons have become popular in the theory and practice of preference modelling and quantification. In case of incomplete data, the arrangements of known comparisons are crucial for the quality of results. We focus on decision problems where the set of pairwise comparisons can be...

In a liability problem, the asset value of an insolvent firm must be distributed among the creditors and the firm itself, when the firm has some freedom in negotiating with the creditors. We model the negotiations using cooperative game theory and analyze the Shapley value to resolve such...

Efficient solution of linear systems of equations is one of the central topics of numerical computation. Linear systems with complex coefficients arise from various physics and quantum chemistry problems. In this paper, we propose a novel ABS-based algorithm, which is able to solve complex...

Formal concept analysis (FCA) is a mathematical theory that is typically used as a knowledge representation method. The approach starts with an input binary relation specifying a set of objects and attributes, finds the natural groupings (formal concepts) described in the data, and then...

Pairwise comparison matrices are increasingly used in settings where some pairs are missing. However, there exist few inconsistency indices for similar incomplete data sets and no reasonable measure has an associated threshold. This paper generalises the famous rule of thumb for the acceptable...

There is increasing attention to the sustainability and fairness of the pay-as-you-go pension system as a consequence of the aging society and the imbalance between the old and the young generation’s number. In this system, the pension depends only on the previous contribution, which...

With the steady growth of energy demands and resource depletion in today’s world, energy prediction models have gained more and more attention recently. Reducing energy consumption and carbon footprint are critical factors for achieving efficiency in sustainable cities. Unfortunately,...

We propose new short-step interior-point algorithms (IPAs) for solving P_* (κ)-linear complementarity problems (LCPs). In order to define the search directions we use the algebraic equivalent transformation technique (AET) of the system which characterizes the central path. A novelty of the...

In this paper, we propose a new long-step interior point method for solving sufficient linear complementarity problems. The new algorithm combines two important approaches from the literature: the main ideas of the long-step interior point algorithm introduced by Ai and Zhang, and the algebraic...

Ezen jegyzetet elektronikus jegyzetnek szánjuk. A lineáris programozási feladatok CPLEX LP kódját sok feladat esetében megadjuk. Ezek a kódok változtatás nélkül futtathatóak, megkönnyítve az eredmények reprodukálását. Ez a módszer a tanulást megkönnyíti, viszont a jegyzet...