Abstract
In this paper, assuming the functions to be B-invex (B-incave), we discuss duality for a class of multiobjective programming problems concerning properly efficient solutions and relate this to certain vector saddle point of a vector-valued Lagrangian. We also show that the duality for multiobjective fractional programming and some other mathematical programming problems follow as special cases.
Keywords
- Efficient Solution
- Constraint Qualification
- Fractional Program
- Multiobjective Programming Problem
- Converse Duality
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. R. Bector, Mathematical Analysis of Some Nonlinear Programming Problems, Ph.D. Thesis, Department of Mathematics, Indian Institute of Technology, 1968.
C. R. Bector, “Duality in Nonlinear Fractional Programming”, Zeitschrift für Operations Research, 17 (1973), 183–193.
C. R. Bector and S. Chandra, “Duality for Pseudolinear Minmax Programs”, Asia-Pacific Journal of Operational, 3 (1986), 86–94.
C. R. Bector, S. Chandra and C. Singh, “Duality in Multiobjective Fractional Programming”, Proceedings of the International Workshop on “Generalized Concavity Fractional Programming and Economic Applications”, May 30-June 1, 1988. (Eds.) A. Cambini, E. Castagnoli, L. Martein, P. Mazzoleni and S. Schaible, Springer Verlag, 232–241.
C. R. Bector and C. Singh, “B-vex Functions”, Journal of Optimization Theory and Applications, 71 (1991), 237–253.
C. R. Bector, S. K. Suneja and C. S. Lalitha, “ Generalized B-vex Functions and Generalized B-vex Programming”, Journal of Optimization Theory and Applications, 76 (1993), 561–576.
D. Bhatia and R. K. Budhraja, “On a Class of Fractional Functional Programming Problems”, Opsearch, 27 (1990), 225–238.
E. Castagnoli and P. Mazzoleni, “About Derivatives of Some Generalized Concave Functions”, Journal of Information and Optimization Sciences, 10 (1989), 53–64.
S. Chandra, B. D. Craven and B. Mond, “Vector-valued Lagrangian and Multiobjective Fractional Programming Duality”, Numerical Functional Analysis and Optimization, 11 (1990), 239–254.
B. D. Craven, “Lagrangian Conditions and Quasiduality”, Bulletin of Australian Mathematical Society, 16 (1977), 325–339.
R. R. Egudo, “Multiobjective Fractional Duality”, Bulletin of Australian Mathematical Society, 37 (1988), 367–378.
R. N. Kaul and V. Lyall, “A Note on Nonlinear Fractional Vector Maximization” Opsearch, 26 (1989), 108–121.
O. L. Mangasarian, Nonlinear Programming, McGraw - Hill Book Company, U.S.A. (1969).
W. Rodder, “A Generalized Saddle Point Theory, Its Applications to Duality Theory for Linear Vector Optimum Problems”, European Journal of Operational Research, 1 (1977), 55–59.
S. Schaible, “Bibliography in Fractional Programming”, Zeitschrift für Operations Research, 26 (1982), 211–241.
C. Singh, “A Class of Multiple Criteria Fractional Programming Problems”, Journal of Mathematical Analysis and Applications, 115 (1986), 202–213.
S. Suneja and S. Gupta, “Duality in Multiobjective Fractional Programming Problems Involving Nonconvex Functions”, Proceedings of XXIII Annual Convention of Operational Research Society of India (1990), 603–617.
S. K. Suneja, C. Singh and C. R. Bector, “Generalizations of Pre-invex Functions and B-vex Functions”, Journal of Optimization Theory and Applications, 76 (1993), 577–587.
T. Weir and B. Mond, “Generalized Convexity and Duality in Multiple Objective Programming”, Bulletin of Australian Mathematical Society, 39 (1989), 287–299.
T. Weir, “A Dual For Multiobjective Fractional Programming Problem”, Journal of Information and Optimization Sciences, 7 (1986), 261–269.
T. Weir, “A Duality Theorem for a Multiobjective Fractional Optimization Problem”, Bulletin of Australian Mathematical Society, 34 (1986), 415–425.
T. Weir, “On Duality in Multiobjective Fractional Programming”, Opsearch, 26 (1989), 151–158.
T. Weir, “On Strong Pseudoconvexity in Nonlinear Programming Duality”, Opsearch, 27 (1990), 117–121.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bector, C.R., Bector, M.K., Gill, A., Singh, C. (1994). Duality for vector valued B-invex programming. In: Komlósi, S., Rapcsák, T., Schaible, S. (eds) Generalized Convexity. Lecture Notes in Economics and Mathematical Systems, vol 405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46802-5_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-46802-5_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57624-2
Online ISBN: 978-3-642-46802-5
eBook Packages: Springer Book Archive