Volume 2, Issue 2, April 2017, Page: 21-27
Solving Definite Quadratic Bi-Objective Programming Problems by KKT Conditions
Amanu Gashaw, Department of Mathematics, College of Natural Science, Arba Minch University, Arba Minch, Ethiopia
Getinet Alemayehu, Department of Mathematics, College of Natural Science, Haramaya University, Haramaya, Ethiopia
Received: Jun. 27, 2016;       Accepted: Jul. 11, 2016;       Published: Apr. 25, 2017
DOI: 10.11648/j.mma.20170202.12      View  1774      Downloads  93
Abstract
A bi-objective programming has been proposed for dealing with decision process involving two decision makers. In this paper, a bi-objective programming problem in which both objective functions are definite quadratic is considered. The feasible region is assumed to be a convex polyhedron. Solution methods namely; using KKT Conditions is developed. Illustrative examples for the method are presented and theorems and facts to support the method are also discussed. The solution of the examples are obtained using a LINGO (15.0) mathematical software.
Keywords
Bi-Objective Programming, Definite Quadratic Programming, Quadratic Programming, KKT Conditions
To cite this article
Amanu Gashaw, Getinet Alemayehu, Solving Definite Quadratic Bi-Objective Programming Problems by KKT Conditions, Mathematical Modelling and Applications. Vol. 2, No. 2, 2017, pp. 21-27. doi: 10.11648/j.mma.20170202.12
Copyright
Copyright © 2017 Authors retain the copyright of this article.
This article is an open access article distributed under the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/) which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Reference
[1]
Benoit C. Chachuat. 2007. Nonlinear and dynamic optimization, IC-32: Winter Semister.
[2]
Etoa, J. B. E. 2011. Solving quadratic convex bi-level programming problems using a smooth method, Applied Mathematics and Computation, 217 (15): 6680-6690.
[3]
Hosseini, E. and Isa Nakhai, I, K. 2014. Taylor approach for solving nonlinear bi-level programming, 3 (11): 2322-5157.
[4]
Jin Hyuk Jung. 2008. Adaptive constraint reduction for convex quadratic programming and training support vector machines, University of Maryland.
[5]
Kalyanmoy Deb. Multi-objective optimization using evolutionary algorithm, Indian Institute of Technology, Kanpur, India, 48-53.
[6]
Liu, G. P., Yang, J. B. and Whidborne, J. F. 2003. Multi-objective Optimization and Control, Research Studies Press LTD. Baldock, Hertfordshire, England, 73-82.
[7]
Maria M. Seron. 2004. Optimality condition, Center for Complex Dynamics Systems and Control, University of Newcastle, Australia.
[8]
Narang, R. and Arora, S. R. 2009. Indefinite quadratic integer bi-level programming problem with bounded variable, Journal of Operational Research Society of India (OPEARCH), 46 (4): 428-448.
[9]
Ritu Arora and S. R. Arora. 2009. Indefinite quadratic programming problem with multi-objectives at both levels, International Journal of Optimization: Theory, Methods and Applications, 1 (3): 318-327.
[10]
Wang, Y. P. and Li, H. C. 2011. Agenetic algorithm for solving linear-quadratic programming problems, Advances Materials Research, 186: 626-630.
Browse journals by subject