×
Suneja, S. K.; Lalitha, C. S.; Khurana, Seema

Second order symmetric duality in multiobjective programming. (English) Zbl 1028.90050

Eur. J. Oper. Res. 144, No. 3, 492-500 (2003).
Summary: A pair of Mond-Weir type multiobjective second order symmetric dual programs are formulated without non-negativity constraints. Weak duality, strong duality and converse duality theorems are established under \(\eta\)-convexity and \(\eta\)-pseudoconvexity assumptions. A second order self-duality theorem is given by assuming the functions involved to be skew-symmetric.

Cited in 38 Documents

MSC:

90C29 Multi-objective and goal programming
90C46 Optimality conditions and duality in mathematical programming

Keywords:

Mathematical programming; Multiobjective symmetric duality; \(\eta\)-convexity; Efficient solutions; Properly efficient solutions
Cite Review PDF
Full Text: DOI

References:

[1] C.R. Bector, S. Chandra, Generalized bonvex functions and second order duality in Mathematical Programming, Research Report 85-2, Department of Actuarial and Management Sciences, The University of Manitoba, Winnipeg, January 1985; C.R. Bector, S. Chandra, Generalized bonvex functions and second order duality in Mathematical Programming, Research Report 85-2, Department of Actuarial and Management Sciences, The University of Manitoba, Winnipeg, January 1985
[2] Bector, C. R.; Chandra, S., Second order symmetric and self-dual programs, Opsearch, 23, 2, 89-95 (1986) · Zbl 0604.90117
[3] Chandra, S.; Prasad, D., Symmetric duality in multiobjective programming, Journal of Australian Mathematical Society, 35, 198-206 (1993) · Zbl 0802.90087
[4] Craven, B. D., Lagrangian conditions and quasiduality, Bulletin of Australian Mathematical Society, 16, 325-339 (1977) · Zbl 0362.90106
[5] Dantzig, G. B.; Eisenberg, E.; Cottle, R. W., Symmetric dual nonlinear programs, Pacific Journal of Mathematics, 15, 809-812 (1965) · Zbl 0136.14001
[6] Dorn, W. S., A symmetric dual theorem for quadratic programs, Journal of the Operations Research Society of Japan, 2, 93-97 (1960) · Zbl 0095.14503
[7] Geoffrion, A. M., Proper efficiency and the theory of vector maximization, Journal of Mathematical Analysis and Applications, 22, 618-630 (1968) · Zbl 0181.22806
[8] Gulati, T. R.; Hussain, I.; Ahmed, A., Multiobjective symmetric duality with invexity, Bulletin of the Australian Mathematical Society, 56, 25-36 (1997) · Zbl 0904.90148
[9] Hanson, M. A., Second order invexity and duality in mathematical programming, Opsearch, 30, 4, 313-320 (1993) · Zbl 0799.90105
[10] Kumar, P.; Bhatia, D., A note on symmetric duality for multiobjective nonlinear programs, Opsearch, 32, 3, 172-183 (1995)
[11] Mangasarian, O. L., Second and higher order duality in nonlinear programming, Journal of Mathematical Analysis and Applications, 51, 607-620 (1975) · Zbl 0313.90052
[12] Mond, B., A symmetric dual theorem for nonlinear programs, Quarterly Journal of Applied Mathematics, 23, 265-269 (1965) · Zbl 0136.13907
[13] Mond, B., Second order duality for nonlinear programs, Opsearch, 11, 90-99 (1974)
[14] Mond, B.; Weir, T., Generalized concavity and duality, (Schaible, S.; Ziemba, W. T., Generalized Concavity in Optimization and Economics (1981), Academic Press: Academic Press New York) · Zbl 0538.90081
[15] Pandey, S., Duality for multiobjective fractional programming involving generalized \(η\)-bonvex functions, Opsearch, 28, 1, 36-43 (1991) · Zbl 0737.90067
[16] Weir, T.; Mond, B., Symmetric and self-duality in multiobjective programming, Asia Pacific Journal of Operational Research, 5, 2, 124-133 (1988) · Zbl 0719.90064
[17] Weir, T.; Mond, B., Generalized convexity and duality in multiple objective programming, Bulletin of the Australian Mathematical Society, 39, 287-299 (1989) · Zbl 0651.90083
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.