Duality in vector optimization. III: Vector partially quasiconcave programming and vector fractional programming. (English) Zbl 0575.49007

[For part II see the paper reviewed above.]
The so-called \(T_ 2\)-duality concept for a certain class of vector optimization programs is introduced. Further, both the \(T_ 1\)-duality theory and the \(T_ 2\)-duality theory are applied for some classes of vector fractional programming. Finally, for completeness, some \(T_ 1\)- duality theorems are formulated and proved in the last section.


49N15 Duality theory (optimization)
52A20 Convex sets in \(n\) dimensions (including convex hypersurfaces)
90C32 Fractional programming
49J45 Methods involving semicontinuity and convergence; relaxation
Full Text: EuDML


[1] Tran Quoc Chien: Duality in vector optimization. Part I. Abstract duality scheme. Kybernetika 20 (1984), 4, 304-314. · Zbl 0556.49010
[2] Tran Quoc Chien: Duality in vector optimization. Part II. Vector quasiconcave programming. Kybernetika 20 (1984), 5, 386-404. · Zbl 0575.49006
[3] S. Schaible: A Survey of Fractional Programming: Generalized Concavity in Optimization and Economics. Wiley, New York 1981.
[4] S. Schaible: Duality in fractional programming: a unified approach. Oper Res. 24 (1976) 3, 452-461. · Zbl 0348.90120
[5] S. Schaible: Fractional programming I: duality. Management Sci. 22 (1976), 8, 858-867. · Zbl 0338.90050
[6] S. Schaible: Analyse und Anwendungen von Quotientenprogrammen. Hein-Verlag, Meisenheim 1978. · Zbl 0395.90045
[7] U. Passy: Pseudoduality in mathematical programs with quotients and ratios. J. Optim. Theory Appl. 33 (1981) 3, 349-374. · Zbl 0424.90065
[8] B. Martos: Nonlinear Programming, Theory and Methods. Akadémiai Kiadó, Budapest 1975. · Zbl 0357.90027
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.