Mishra S.K., Giorgo G. — Invexity and Optimization :: Электронная библиотека попечительского совета мехмата МГУ

Главная Ex Libris Книги Журналы Статьи Серии Каталог Wanted Загрузка ХудЛит Справка Поиск по индексам Поиск Форум

Авторизация

Поиск по указателям

Mishra S.K., Giorgo G. — Invexity and Optimization

Обсудите книгу на научном форуме

Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter

Название: Invexity and Optimization

Авторы: Mishra S.K., Giorgo G.

Аннотация:

Invexity and Optimization presents results on invex function and their properties in smooth and nonsmooth cases, pseudolinearity and eta-pseudolinearity. Results on optimality and duality for a nonlinear scalar programming problem are presented, second and higher order duality results are given for a nonlinear scalar programming problem, and saddle point results are also presented. Invexity in multiobjective programming problems and Kuhn-Tucker optimality conditions are given for a multiobjecive programming problem, Wolfe and Mond-Weir type dual models are given for a multiobjective programming problem and usual duality results are presented in presence of invex functions. Continuous-time multiobjective problems are also discussed. Quadratic and fractional programming problems are given for invex functions. Symmetric duality results are also given for scalar and vector cases.

Язык:

Рубрика: Математика/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 2008

Количество страниц: 266

Добавлена в каталог: 08.05.2008

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID

Предметный указатель

$(h,\phi)$ -convex      11
$(\alpha, \lambda)$ -convex      11
$\eta$ -Lagrange function      153
$\eta$ -pseudolinear      39
$\rho$ -invex function      19
$\rho$ -pseudo-invex function      20
$\rho$ -quasi-invex function      20
(h, F)-convex function      31
Affine map      48
Approximately quasidifferentiable      66
Arcwise convex      11
Arrow — Hurwicz — Uzawa constraint qualification      77
Conditionally properly efficient      122
Constrained vector optimization      116
Control      11
Convex      11
Convexlike      11
Duality      11
Efficient solution      115 169
F-convex function      29 32
Fractional programming      211
Fractional variational problems      240
Generalized derivative      60
Generalized schwarz inequality      216
Higher order dual model      228
Higher order invex      229
Higher order strong pseudo invex      229
Higher order strong quasi invex      229
Higher order weak pseudo-invex      229
Higher order weak quasi-invex      229
Higher order weak strictly pseudo invex      229
Invex      11
Invex function      12 116 158
Invex monotone      45
Invex set      39
K-inf-stationary point      69
K-invex      70
K-invex function      18
KT-invex      120
KT-proper efficient solution      121
KT-pseudo-invex      120
Linearized multiobjective program      151
Locally invex function      18
Locally Lipschitz      60
minimax      11
Minimum point      13
Mixed integer programs      187
Mond — Weir type multiobjective symmetric duality      154
Monotone map      42
Multiobjective continuous-time programming      168
Multiobjective symmetric duality      153
Nondifferentiable fractional symmetric duality      235
Nondifferentiable mathematical programming problems      215
Nondifferentiable multiobjective maximization      221
Nonsmooth invex      67
Nonsmooth multiobjective programming problem      135
Nonsmooth pseudo-invex function      136
Nonsmooth quasi-invex function      136
Nonsmooth V - ?-invex function      137
Optimality      11
p-convex functions      30

P-quasidifferentiable      62
PARETO      115
Partially invex      186
Partially pseudo-invex      187
Pre-pseudoinvex      58
Pre-quasi-invex      58
Preinvex      51
Properly efficient solution      122 169
Pseudo-convex      11
Pseudo-invex      44 159
Pseudo-invex function      18
Pseudo-invex monotone      45
Pseudo-monotone      43
Pseudo-quasi-type I function      125
Pseudo-quasi-V -type I      133
Pseudo-type I function      124
Quadratic programming      207
Quasi-convex      11
Quasi-invex      44 159
Quasi-invex function      18
Quasi-invex monotone      45
Quasi-monotone      43
Quasi-pseudo-type I function      125
Quasi-type I function      124
r-convex function      30
r-convex functions      30 119 142 143 163 186
Regular      64
Saddle point      104 153
Self-duality      248
Semi-strictly quasi-convex function      28
Skew symmetric function      45
Slater constraint qualification      77
Stationary point      61
Strictly invex      44
Strictly invex monotone      45
Strictly monotone      42
Strictly pseudo-invex      44
Strictly pseudo-invex monotone      45
Strictly pseudo-monotone      43
Strongly $\rho$ -invex function      19
Symmetric dual pair      166
Type I function      124
Unconstrained vector optimization      115
Univex function      128
V-invex      212
V-invex function      175
V-pseudo-invex function      175
V-type I function      126
Vector critical point      117
Vector Fritz — John point      118
Vector Kuhn — Tucker point      118
Weak efficient      115
Weak minimum      169
Weak pre-quasi-invex      127
Weak strictly pseudo-invex      131
Weak strictly-pseudo-quasi-type I      132
Weak vector saddle-point      149
Weakly -invex function      19
Wolfe dual      207
Zangwill constraint qualification      77
Zero duality gap      148

О проекте