The method of Weighted Multi objective Fractional Linear Programming Problem (MOFLPP)

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