Celebrating eighty years of Professor Nožička
Non-negative linear combinations of -norms and their conorms are used to formulate some decision making problems using systems of max-separable equations and inequalities and optimization problems under constraints described by such systems. The systems have the left hand sides equal to the maximum of increasing functions of one variable and on the right hand sides are constants. Properties of the systems are studied as well as optimization problems with constraints given by the systems and appropriate...
Properties of (max,+)-linear and (min,+)-linear equation systems are used to study solvability of the systems. Solvability conditions of the systems are investigated. Both one-sided and two-sided systems are studied. Solvability of one class of (max,+)-nonlinear problems will be investigated. Small numerical examples illustrate the theoretical results.
The aim of this short contribution is to point out some applications of systems of so called two-sided -linear systems of equations and inequalities of [Gavalec, M., Zimmermann, K.: Solving systems of two-sided (max,min)-linear equations Kybernetika 46 (2010), 405–414.] to solving some fuzzy set multiple fuzzy goal problems. The paper describes one approach to formulating and solving multiple fuzzy goal problems. The fuzzy goals are given as fuzzy sets and we look for a fuzzy set, the fuzzy intersections...
-linear functions are functions which can be expressed as the maximum of a finite number of linear functions of one variable having the form , where , , are real numbers. Similarly -linear functions are defined. We will consider optimization problems in which the set of feasible solutions is the solution set of a finite inequality system, where the inequalities have -linear functions of variables on one side and -linear functions of variables on the other side. Such systems...
A finite iteration method for solving systems of (max, min)-linear equations is presented. The systems have variables on both sides of the equations. The algorithm has polynomial complexity and may be extended to wider classes of equations with a similar structure.
The main purpose of this article is to provide an exact theory of the dynamic programming on a sufficiently general basis. Let be a compact topological Hausdorff’s space, let be the set of all continuous transformations of the space into itself. Suppose such a topology is introduced on that is Haousdorff’s space and that the transformation of the product into is continuous with respect to Tichonoff’s topology on . Suppose is a compact subspace of and . We define the transformations...
The structure of solution-sets for the equation is discussed, where are given residuated functions mapping between partially-ordered sets. An algorithm is proposed which produces a solution in the event of finite termination: this solution is maximal relative to initial trial values of . Properties are defined which are sufficient for finite termination. The particular case of max-based linear algebra is discussed, with application to the synchronisation problem for discrete-event systems;...
Page 1