Journal:Informatica
Volume 34, Issue 3 (2023), pp. 465–489
Abstract
The Best-Worst Method (BWM) is a recently introduced, innovative multi-criteria decision-making (MCDM) technique used to determine criterion weights for selection processes. However, another method is needed to complete the selection of the most preferred alternative. In this research, we propose a group decision-making methodology based on the multiplicative BWM to make this selection. Furthermore, we give new models that allow for groups with different best and worst criteria to exist. This capability is crucial in reconciling the differences among experts from various geographical locations with diverse evaluation perspectives influenced by social and cultural disparities. Our work contributes significantly in three ways: (1) we propose a BWM-based methodology for evaluating alternatives, (2) we present new linear models that facilitate decision-making for groups with different best and worst criteria, and (3) we develop a dissimilarity ratio to quantify the differences in expert opinions. The methodology is illustrated via numerical experiments for a global car company deciding which car model alternative to introduce in its markets.
Pub. online:1 Jan 2018Type:Research ArticleOpen Access
Journal:Informatica
Volume 29, Issue 2 (2018), pp. 187–210
Abstract
A relevant challenge introduced by decentralized installations of photo-voltaic systems is the mismatch between green energy production and the load curve for domestic use. We advanced an ICT solution that maximizes the self-consumption by an intelligent scheduling of appliances. The predictive approach is complemented with a reactive one to minimize the short term effects due to prediction errors and to unforeseen loads. Using real measures, we demonstrated that such errors can be compensated modulating the usage of continuously running devices such as fridges and heat-pumps. Linear programming is used to dynamically compute in real-time the optimal control of these devices.
Journal:Informatica
Volume 14, Issue 1 (2003), pp. 37–62
Abstract
The Markowitz model for single period portfolio optimization quantifies the problem by means of only two criteria: the mean, representing the expected outcome, and the risk, a scalar measure of the variability of outcomes. The classical Markowitz model uses the variance as the risk measure, thus resulting in a quadratic optimization problem. Following Sharpe's work on linear approximation to the mean‐variance model, many attempts have been made to linearize the portfolio optimization problem. There were introduced several alternative risk measures which are computationally attractive as (for discrete random variables) they result in solving Linear Programming (LP) problems. The LP solvability is very important for applications to real‐life financial decisions where the constructed portfolios have to meet numerous side constraints and take into account transaction costs. This paper provides a systematic overview of the LP solvable models with a wide discussion of their properties.
Journal:Informatica
Volume 11, Issue 4 (2000), pp. 421–434
Abstract
It is well known that in linear programming, the optimal values of the dual variables can be interpreted as shadow prices (marginal values) of the right-hand side coefficients. However, this is true only under nondegeneracy assumptions. Since real problems are often degenerate, the output from conventional LP software regarding such marginal information can be misleading. This paper surveys and generalizes known results in this topic and demonstrates how true shadow prices can be computed with or without modification to existing software.
Journal:Informatica
Volume 8, Issue 4 (1997), pp. 559–582
Abstract
In this research, we develop an algorithm for linear programming problems based on a new interpretation of Karmarkar's representation for this problem. Accordingly, we examine a suitable polytope for which the origin is an exterior point, and in order to determine an optimal solution, we need to ascertain the minimum extent by which this polytope needs to be slid along a one-dimensional axis so that the origin belongs to it. To accomplish this, we employ strongly separating hyperplanes between the origin and the polytope using a closest point routine. The algorithm is further enhanced by the generation of dual solutions which enable us to deform the polytope so that it is favorably positioned with respect to the origin and the axis of sliding motion. The overall scheme is easy to implement, requires a minimal amount of storage, and produces quick good quality lower bounds for the problem in its infinite convergence process. A switchover to the simplex method or an interior point method is also possible, using the current available solution as an advanced start. Preliminary computational results are provided along with implementation guidelines.