Results 21 to 30 of about 469 (71)
Optimality and duality in set-valued optimization utilizing limit sets
Open Mathematics, 2018 This paper deals with optimality conditions and duality theory for vector optimization involving non-convex set-valued maps. Firstly, under the assumption of nearly cone-subconvexlike property for set-valued maps, the necessary and sufficient optimality ...
Kong Xiangyu, Zhang Yinfeng, Yu GuoLin
doaj +1 more source
Speeding up Martins' algorithm for multiple objective shortest path problems [PDF]
, 2013 The latest transportation systems require the best routes in a large network with respect to multiple objectives simultaneously to be calculated in a very short time.
Audenaert, Pieter +4 more
core +2 more sources
The proximal point method for locally lipschitz functions in multiobjective optimization with application to the compromise problem [PDF]
, 2018 This paper studies the constrained multiobjective optimization problem of finding Pareto critical points of vector-valued functions. The proximal point method considered by Bonnel, Iusem, and Svaiter [SIAM J. Optim., 15 (2005), pp.
Bento, Glaydston de Carvalho +4 more
core +1 more source
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
Optimality Conditions for D.C. Vector Optimization Problems under D.C. Constraints [PDF]
, 2004 2000 Mathematics Subject Classification: Primary 90C29; Secondary 49K30.In this paper, we establish necessary optimality conditions and sufficient optimality conditions for D.C. vector optimization problems under D.C. constraints.
Gadhi, N., Metrane, A.
core
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
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