Computational Development of Duality for Mathematical Programming Problem: Historic Analysis
##plugins.themes.bootstrap3.article.main##
Abstract
The theory of classical duality programming problem launched in 1948, an
alternative approach to solve the mathematical programming problem. The questions of whether the duality can be seen as a multiple discovery and why the duality results were served as boon in solving mathematical programming problems and employed in the different fields. On the basis of a contextualized historic analysis of this work, the significance of contexts both computationally and theoretically for these questions are illustrated which includes the role played in mathematical programming problem.
References
Bhatia, M. (2012). Some Aspects of Optimality and Duality in Vector Optimization. University of Delhi.
Chandra, S., Craven, B. D., & Mond, B. (1985). Symmetric duality in fractional programming. Zeitschrift für Operations Research, 29, 59–64.
Craven, B. D. (1981). Invex functions and constrained local minima. Bulletin of the Australian Mathematical Society, 24(3), 357–367.
Craven, B. D. (1980). Strong vector minimization and duality. ZAMM – Zeitschrift für Angewandte Mathematik und Mechanik, 60.
Cottle, R. W. (1963). A theorem of Fritz John in mathematical programming. RAND Memorandum RM-3858-PR, 111–123.
Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press, New Jersey.
Dorn, W. S. (1960). Duality in quadratic programming. Quarterly Journal of Applied Mathematics, 18, 155–162. https://doi.org/10.1090/qam/112751
Egudo, R. R. (1988). Multiobjective fractional duality. Bulletin of the Australian Mathematical Society, 37, 367–378.
Evgeniou, T., & Pontil, M. (2001). Support vector machines: Theory and applications, 249–257.
Farkas, G. J. (1899). Die algebraische Grundlage der Anwendungen des mechanischen Prinzips von Fourier. Mathematische und Naturwissenschaftliche Berichte aus Ungarn, 16, 154–157.
Farkas, G. J. (1901). Theorie der einfachen Ungleichungen. Journal für die reine und angewandte Mathematik, 124, 1–27.
Figueroa-Garcia, J. C., Hemandez, G., & Franco, C. (2022). A review on history, trends and perspective of fuzzy linear programming. Operations Research Perspectives. https://doi.org/10.1016/j.orp.2022.100247
Gale, D. (1951). Convex polyhedral cones and linear inequalities. In Activity Analysis of Production and Allocation, John Wiley & Sons, New York.
Gale, D. (1956). Neighbouring vertices on a convex polyhedron. Annals of Mathematics Studies, 38, 253–263.
Goldman, A. J., & Tucker, A. W. (1956). Polyhedral convex cones. Annals of Mathematics Studies, 38, 19–39.
Hitchcock, F. L. (1941). The distribution of a product from several sources to numerous localities. MIT Journal of Mathematics and Physics, 20, 224–230.
Jahn, J. (2004). Vector Optimization: Theory, Applications and Extensions. Springer, Berlin.
John, F. (1948). Extremum problems with inequalities as subsidiary conditions. Courant Anniversary Volume, 197–215.
Khurana, S. (2005). Symmetric duality in multiobjective programming involving generalized cone-invex functions. European Journal of Operational Research, 165(3), 592–597.
Klinger, A. (1967). Improper solutions of vector minimum problems. Operations Research, 15, 570–572.
Koopmans, T. C. (1947). Optimum utilization of the transportation system. Proceedings of the International Statistical Conference, Washington D.C.
Kuhn, H. W., & Tucker, A. W. (1951). Nonlinear programming. Second Berkeley Symposium on Mathematical Statistics and Probability, University of California Press, 481–493.
Lalitha, C. S., Suneja, S. K., & Khurana, S. (2003). Symmetric duality involving invexity in multiobjective fractional programming. Asia-Pacific Journal of Operations Research, 20, 57–72.
Mond, B., & Weir, T. (1981). Generalized concavity in optimization and duality. In Generalized Concavity in Optimization and Economics, New York, 263–279.
Mangasarian, O. L. (1975). Second and higher-order duality in nonlinear programming. Journal of Mathematical Analysis and Applications, 51, 607–620.
Mangasarian, O. L. (1969). Nonlinear Programming. McGraw-Hill, New York.
Reiland, T. W. (1990). Nonsmooth invexity. Bulletin of the Australian Mathematical Society, 42(3), 437–446.
Rockafellar, R. T. (1969). Convex functions and duality in optimization problems. Lecture Notes in Operations Research and Mathematical Economics, 11(12), 117–141. https://doi.org/10.1007/978-3-642-46196-5-7
Suneja, S. K., & Gupta, S. (1998). Duality in multiobjective nonlinear programming involving semilocally convex functions. European Journal of Operational Research, 107(3), 675–685.
Suneja, S. K., Gupta, S., & Vani. (2007). Optimality and duality in multiobjective nonlinear programming. Opsearch, 44(1), 27–40.
Trafalis, T. B. (1999). Primal-dual optimization methods in neural networks and SVM training. ACA. https://api.semanticscholar.org/CorpusID:8936459
Vapnik, V. (1998). Statistical Learning Theory. New York. https://api.semanticscholar.org/CorpusID:61112307
Weir, T. (1986). A duality theorem for multiple objective fractional optimization problem. Bulletin of the Australian Mathematical Society, 34, 415–425.
Weir, T., Mond, B., & Craven, B. D. (1987). Weak minimization and duality. Numerical Functional Analysis and Optimization, 9, 181–192. https://doi.org/10.1080/01630568708816230
Wolfe, P. (1961). A duality theorem for nonlinear programming. Quarterly Journal of Applied Mathematics, 19, 239–244.
Singh, C., Suneja, S. K., & Rueda, N. G. (1992). Preinvexity in multiobjective fractional programming. Journal of Information and Optimization Science, 8, 293–302.
Neumann, J. V. (1947). Discussion of maximization problem. Institute for Advanced Study, Princeton, New Jersey.
Yen, N. D., & Sach, P. H. (1993). On locally Lipschitz vector-valued invex functions. Bulletin of the Australian Mathematical Society, 47, 259–271.
License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.