The method of Weighted Multi objective Fractional Linear Programming Problem (MOFLPP) | ||
| Journal of University of Anbar for Pure Science | ||
| Article 53, Volume 7, Issue 2, August 2013, Pages 1-6 PDF (628.86 K) | ||
| Document Type: Research Paper | ||
| DOI: 10.37652/juaps.2013.85017 | ||
| Authors | ||
| Waleed Khalid Jaber* 1; Zeanab k. jabar2 | ||
| 1Thi- Qar University- College of Computer science and mathematical | ||
| 2Dhi Qar University - College of Computer Science and Mathematics | ||
| Abstract | ||
| More theories and algorithms in non-linear programming with titles convexity (Convex). When the objective function is fractional function, will not have to have any swelling, but can get other good properties have a role in the development of algorithms decision problem.In this work we focus on the weights method- (one of the classical methods to solve Multi objective convex case problem). Since we have no convex or no concave objective functions, and this condition is essential part on this method implementation, we these valid conditions under method as generator sets efficient and weakly efficient this problem. This raises the need to a detailed study of pseudoconvex idea, cause convex idea, Invex, pseudoinvex idea,…, etc. concepts. Offer a numerical example to show the valid by the conditions previously set generate all weakly efficient set our problem. | ||
| Keywords | ||
| Weighted; Multi objective Fractional Linear Programming Problem; MOFLPP | ||
| References | ||
|
[1]. Ben-Israel, Mond, B. (1986), What is the invexity, Australian Mathematical Journal Society, Series B, Vol 28, pp. 1-9.
[2]. Craven, B. D. (1981), Invex Functions and constrained local minima, Bull. Australian Math. Soc, Vol 24, pp. 357-366.
[3]. Craven, B. D. (1988), Fractional Programming, Sigma Series in Applied Mathematics, Vol 4, Heldermann Verlag, Berlin.
[4]. Falk, J.E.; Palocsay, S.W. (1992), Optimizing the sum of linear fractional functions, in Recent Advances in Global Optimization, eds. Floud, Ch A. and Pardalos, P.M.,Being Princeton Computer. Sci, Princeton University Press, Princeton, NJ, pp. 221-258.
[5]. Gass, S., Saaty, T. (1955), The computational algorithm for the parametric Objective function, Naval Research Logist. Quart. , Vol 2, pp. 39-45.
[6]. Hanson, M.A. (1981), On sufficiency of Kuhn-Tucker Conditions, Journal of Mathematical Analysis and Applications, Vol 30, pp. 545-550.
[7]. Mangasarian, O.L. (1969), Nonlinear Programming, Series in Systems science, McGraw-Hill, New York.
[8]. Martin, D.H. (1985), The essence of invexity, Journal of Optimization Theory and Applications, Vol 47, No. 1, pp. 65-76.
[9]. Miettinen, K. (1999) Nonlinear Multi objective optimization, Kluwer Academic Publishers, Massachusetts.
[10]. Osuna, R., Beato, A., Luque, P.; Ruffian, A. (1996) Functions in Invex and pseudoinvex Multi objective programming, Lecture Notes in Economics and Mathematics Systems, Vol 455, pp. 228-234. [11]. Zadeh, L. (1963), Optimality and non-scalar-valued performance criteria, IEEE Transactions on Automatic Control, Vol 8, pp. 59-60. | ||
|
Statistics Article View: 160 PDF Download: 143 |
||