Continuous Programming Containing Support Functions

다국어 초록 (Multilingual Abstract)

In this paper, we derive necessary optimality conditions for a continuous programming problem in which both objective and constraint functions contain support functions and is, therefore, nondifferentiable. It is shown that under generalized invexity of functionals, Karush-Kuhn-
Tucker type optimality conditions for the continuous programming problem are also sufficient. Using these optimality conditions, we construct dual problems of both Wolfe and Mond-Weir types and validate appropriate duality theorems under invexity and generalized invexity. A mixed type dual is also proposed and duality results are validated under generalized
invexity. A special case which often occurs in mathematical programming is that in which the support function is the square root of a positive semidefinite quadratic form. Further, it is also pointed out that our results can be considered as dynamic generalizations of those of (static) nonlinear programming with support functions recently incorporated in the literature.

다국어 초록 (Multilingual Abstract)

In this paper, we derive necessary optimality conditions for a continuous programming problem in which both objective and constraint functions contain support functions and is, therefore, nondifferentiable. It is shown that under generalized invexity of functionals, Karush-Kuhn-
Tucker type optimality conditions for the continuous programming problem are also sufficient. Using these optimality conditions, we construct dual problems of both Wolfe and Mond-Weir types and validate appropriate duality theorems under invexity and generalized invexity. A mixed type dual is also proposed and duality results are validated under generalized
invexity. A special case which often occurs in mathematical programming is that in which the support function is the square root of a positive semidefinite quadratic form. Further, it is also pointed out that our results can be considered as dynamic generalizations of those of (static) nonlinear programming with support functions recently incorporated in the literature.

참고문헌 (Reference)

1 A. Ben-Israel, "What is invexity?" 28 : 1-9, 1986

2 V. F. Demyanov, "Quasidfferential calculus, Mathematical Programming Study 29, North Holland, Amsterdam"

3 F. H. Clarke, "Optimization and non-smooth analysis" 1983

4 I. Husain, "On nonlinear programming with support functions" 10 (10): 83-99, 2002

5 C. R. Bector, "On mixed duality in mathematical programming" 259 : 346-356, 2001

6 O. L. Mangasarian, "Nonlinear Programming" Mctgraw-Hill 1969

7 B. Mond, "Nondifferentiable symmetric duality" 53 : 177-188, 1996

8 Z. Xu, "Mixed type duality in multiobjective programming" 198 : 135-144, 1996

9 I. Husain, "Mixed type duality for a programming problem containing support functions, submitted for publication"

10 B. D. Craven, "Mathematical Programming and Control Theory" Chapman and Hall 1978

11 B. D. Craven, "Lagrangean conditions for quasi-differentiable optimization; Proc. of 9th Int Mathematical Programming, Budapest" 177-192, 1976

12 F. H. Clarke, "Generalized gradients of Lipschitz functionals" 40 : 52-67, 1981

13 C. R. Bector, "Generalized concavity and nondifferentiable continuous programming duality" University of Manitoba 1985

14 B. Mond, "Duality with invexity for a class of nondifferentiable static and continuous programming problems" 141 : 373-388, 1989

15 B. Mond, "Duality for variational problems with invexity" 134 : 322-328, 1988

16 R. Courant, "Differential and integral calculus, Vol. 2, Blackie, London/Edinburgh"

17 B. Mond, "A duality theorem for a homogeneous fractional programming problem" 25 : 349-359, 1978

18 S. Chandra, "A class of nondifferentiable continuous programming problems" 107 : 122-131, 1985