Results 11 to 20 of about 41 (41)
Sensitivity analysis of efficient solution in vector MINMAX boolean programming problem [PDF]
Computer Science Journal of Moldova, 2002 We consider a multiple criterion Boolean programming problem with MINMAX partial criteria. The extreme level of independent perturbations of partial criteria parameters such that efficient (Pareto optimal) solution preserves optimality was obtained ...
Vladimir A. Emelichev +2 more
doaj
Nash equilibria sets in mixed extension of 2x2x2 games [PDF]
Computer Science Journal of Moldova, 2005 We describe the Nash equilibria set as an intersection of graphs of players' best responses. The problem of Nash equilibria set construction for three-person extended 2 2 2 games is studied.
Valeriu Ungureanu, Ana Botnari
doaj
EURO Journal on Computational Optimization, 2018 Many practical combinatorial optimization problems can be described by integer linear programs having an exponential number of variables, and they are efficiently solved by column generation algorithms.
Christian Artigues +2 more
doaj +1 more source
Open MathematicsIn this article, we work on vector optimization problems in linear topological spaces. Our vector optimization problems have weakened convex inequality constraints and weakened affine equality constraints.
Zeng Renying
doaj +1 more source
On stability in game problems of finding Nash set [PDF]
Computer Science Journal of Moldova, 2005 A finite game of several players in the case of linear payoff functions is considered. Stability of the problem of finding the set of Nash equilibrium situations is investigated.
Sergey E. Bukhtoyarov, Kirill G. Kuzmin
doaj
New geometrical compactness measures for zones design
Revista de Matemática: Teoría y Aplicaciones, 2012 The design of compact zones has been studied because of its influence in the creation of zones with regular forms, which are easier to analyze, to investigate or to administer.
Eric Alfredo Rincón-García +3 more
doaj +1 more source
Quasi-stability of a vector trajectorial problem with non-linear partial criteria [PDF]
Computer Science Journal of Moldova, 2003 Multi-objective (vector) combinatorial problem of finding the Pareto set with four kinds of non-linear partial criteria is considered. Necessary and sufficient conditions of that kind of stability of the problem (quasi-stability) are obtained.
Vladimir A. Emelichev +1 more
doaj
Ingeniería y Ciencia, 2014 En este artículo se presenta una metodología para la reubicación óptima de transformadores en sistemas de distribución. El problema es formulado como un modelo de optimización multiobjetivo de tipo lineal entero, en el cual se consideran costos de ...
Rubén Iván Bolaños +2 more
doaj +1 more source
On quasistability of a vector combinatorial problem with \Sigma-MINMAX and \Sigma-MINMIN partial criteria [PDF]
Computer Science Journal of Moldova, 2004 We consider one type of stability (quasistability) of a vector combinatorial problem of finding the Pareto set. Under quasistability we understand a discrete analogue of lower semicontinuity by Hausdorff of the many-valued mapping, which defines the ...
Vladimir A. Emelichev +2 more
doaj
Stability of generally efficient situation in finite cooperative games with parametric optimality principle ("from Pareto to Nash") [PDF]
Computer Science Journal of Moldova, 2003 A parametric optimality principle (choice function) in a finite cooperative game of several persons is determined. This principle is specified by means of partition of players set into coalitions.
Vladimir A. Emelichev +1 more
doaj