In this paper, we introduce the concepts of higher-order type-I, pseudo-type-I, and quasi-type-I functions and establish various higher-order duality results involving these functions.
On Ratio Invexity in Mathematical Programming
β Scribed by Zulfiqar A. Khan; Morgan A. Hanson
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 111 KB
- Volume
- 205
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
β¦ Synopsis
The nonlinear fractional programming problem is considered. The functions involved in the objective function and constraints are assumed to be invex and differentiable. It is shown that the ratio of invex functions is invex. Sufficient optimality and duality theorems are presented for an invex fractional programming problem.
π SIMILAR VOLUMES
An incomplete Lagrange function is introduced for a class of nonlinear programming problems which explains the reason behind the construction of the MondαWeirαtype dual. A mixed-type dual is presented for a class of fractional and generalized fractional programming problems, and various duality theo
Mathematical programming problems involving p r -invex functions with respect to Ξ· are considered. We introduce new classes of nonlinear programming problems, called KT-p r -invex, WD-p r -invex, and HC-p r -invex problems (where p r are some real numbers). It is shown that for these types of proble