This paper provides some results concerning sensitivity analysis in parametrized Ε½ convex vector optimization. We consider three types of perturbation maps i.e., . perturbation map, proper perturbation map, and weak perturbation map accord-Ε½ ing to three kinds of solution concepts i.e., minimality,
β¦ LIBER β¦
Sensitivity analysis in convex vector optimization
β Scribed by D. S. Shi
- Publisher
- Springer
- Year
- 1993
- Tongue
- English
- Weight
- 649 KB
- Volume
- 77
- Category
- Article
- ISSN
- 0022-3239
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Sensitivity Analysis in Parametrized Con
β
Hun Kuk; Tetsuzo Tanino; Masahiro Tanaka
π
Article
π
1996
π
Elsevier Science
π
English
β 146 KB
Sensitivity analysis in vector optimizat
β
H. Kuk; T. Tanino; M. Tanaka
π
Article
π
1996
π
Springer
π
English
β 561 KB
Super efficiency in convex vector optimi
β
J. M. Borwein; D. M. Zhuang
π
Article
π
1991
π
Springer
π
English
β 344 KB
Sensitivity analysis in convex programmi
β
P. JimΓ©nez Guerra; M.A. Melguizo; M.J. MuΓ±oz-Bouzo
π
Article
π
2009
π
Elsevier Science
π
English
β 536 KB
The object of this paper is to perform an analysis of the sensitivity for convex vector programs with inequality constraints by examining the quantitative behavior of a certain set of optima according to changes of right-hand side parameters included in the program. The results in the paper prove th
Vector Variational Inequalities for Nond
β
Gue Myung Lee; Kwang Baik Lee
π
Article
π
2005
π
Springer US
π
English
β 145 KB
Well-posedness and convexity in vector o
β
E. Miglierina; E. Molho
π
Article
π
2003
π
Springer
π
English
β 268 KB