شماره ركورد كنفرانس :
4057
عنوان مقاله :
Solutions of Exponential functional equations
عنوان به زبان ديگر :
Solutions of Exponential functional equations
پديدآورندگان :
Mohammadzadeh Karizaki Mehdi m.mohammadzadeh@torbath.ac.ir Department Of Computer Engineering, University Of Torbat Heydarieh, Torbat Heydarieh , Hosseini Amin A.Hosseini@mshdiau.ac.ir Department Of Computer Engineering, University Of Torbat Heydarieh, Torbat Heydarieh , Ali-Akbar Mahdi mahdialiakbari@gmail.com Department Of Computer Engineering, University Of Torbat Heydarieh, Torbat Heydarieh
كليدواژه :
Functional equation , Exponential functional Rudin s problem
عنوان كنفرانس :
چهارمين كنفرانس بين المللي آناليز غير خطي و بهينه سازي
چكيده فارسي :
The main idea of defining anchor solutions/points in multiobjective programming comes
from the connections between proper efficiency and weighted sum scalarization. Although an
optimal solution of a weighted sum scalarization problem with positive weights is always properly efficient, the converse is valid under convexity. Due to this fact, there are three possible
cases for properly efficient solutions. 1) Not generated by any weighted sum problem with
positive/nonnegative weight vector; 2) Generated by some weighted sum problem with a positive weight vector, and not generated by any weighted sum problem with nonnegative weight
vector having zero component(s); 3) Generated by a weighted sum problem with nonnegative
weight vector having zero component(s).
In the last case, the properly efficient solution under consideration is called an anchor
solution. This notion was first introduced and investigated in multiobjective programming
by authors of the current manuscript in [11]. In this talk, we focus on more theoretical and
computational characteristics of these solutions
چكيده لاتين :
The main idea of defining anchor solutions/points in multiobjective programming comes
from the connections between proper efficiency and weighted sum scalarization. Although an
optimal solution of a weighted sum scalarization problem with positive weights is always properly efficient, the converse is valid under convexity. Due to this fact, there are three possible
cases for properly efficient solutions. 1) Not generated by any weighted sum problem with
positive/nonnegative weight vector; 2) Generated by some weighted sum problem with a positive weight vector, and not generated by any weighted sum problem with nonnegative weight
vector having zero component(s); 3) Generated by a weighted sum problem with nonnegative
weight vector having zero component(s).
In the last case, the properly efficient solution under consideration is called an anchor
solution. This notion was first introduced and investigated in multiobjective programming
by authors of the current manuscript in [11]. In this talk, we focus on more theoretical and
computational characteristics of these solutions
