On generalised convex mathematical programming
Authors:
- 1 July 1992
- journal article
- research article
- Published by Cambridge University Press (CUP) in The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
- Vol. 34 (1) , 43-53
Abstract
The sufficient optimality conditions and duality results have recently been given for the following generalised convex programming problem:where the funtion f and g satisfyfor some η: X0 × X0 → ℝnIt is shown here that a relaxation defining the above generalised convexity leads to a new class of multi-objective problems which preserves the sufficient optimality and duality results in the scalar case, and avoids the major difficulty of verifying that the inequality holds for the same function η(. , .). Further, this relaxation allows one to treat certain nonlinear multi-objective fractional programming problems and some other classes of nonlinear (composite) problems as special cases.Keywords
This publication has 9 references indexed in Scilit:
- What is invexity?The Journal of the Australian Mathematical Society. Series B. Applied Mathematics, 1986
- On Duality for Weakly Minimized Vector Valued Optimization ProblemsOptimization, 1986
- The essence of invexityJournal of Optimization Theory and Applications, 1985
- Invex functions and dualityJournal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1985
- Pseudolinearity and efficiencyMathematical Programming, 1984
- Generalized convexity in mathematical programmingBulletin of the Australian Mathematical Society, 1983
- Invex functions and constrained local minimaBulletin of the Australian Mathematical Society, 1981
- On sufficiency of the Kuhn-Tucker conditionsJournal of Mathematical Analysis and Applications, 1981
- Mathematical Programming and Control Theory1978