We extend the concepts of B-type I and generalized B-type I functions to the continuous case and we use these concepts to establish sufficient optimality conditions and duality results for multiobjective variational programming problems.
Penalty function methods and a duality gap for invex optimization problems
โ Scribed by Tadeusz Antczak
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 570 KB
- Volume
- 71
- Category
- Article
- ISSN
- 0362-546X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A sufficient optimality theorem is proved for a certain minmax programming ลฝ . problem under the assumptions of proper b, -invexity conditions on the functions involved in the objective and in the constraints. Next a dual is presented for such a problem and duality theorems relating the primal and t
This paper describes an optimization procedure for the minimum weight design of complex structures. The procedure is based on a new cubic extended interior penalty function (CEIPF) used with the sequence of unconstrained minimization technique (SUMT) and Newton's method. The Hessian matrix of the pe