Formulation of Multiobjective Functions to Solve Linear Fractional Programming Problem

Solving Non-linear Constraints in Multiobjective Linear Fractional Programming

by Yonus Ahmad Dar*, Dr. Yogesh Sharma,

- Published in International Journal of Information Technology and Management, E-ISSN: 2249-4510

Volume 7, Issue No. 10, Nov 2014, Pages 0 - 0 (0)

Published by: Ignited Minds Journals


ABSTRACT

Thispaper deals with the formulation of multi objective functions with linearfractional criteria. The complexity of these evils is the non-linear restraintsof the mathematical programming models that have to be solved. When theremanage to survive solutions satisfying all target values, the difficulty iseasy to solve by solving a linear difficulty.

KEYWORD

formulation, multiobjective functions, linear fractional programming problem, complexity, non-linear constraints, mathematical programming models

INTRODUCTION

Fractional programming has paying attention the concentration of many researchers in the history. The main cause for interest in fractional programming stems from the fact that programming models might better fit the real problems if we think optimization of ratio flanked by the physical and / or economic quantities. Literature survey reveals wide applications of fractional programming in dissimilar areas ranging from engineering to economics.

REVIEW OF LITERATURE:

Formulation of multi objective functions:

The same loom taken by sulaiman and Gulnar (Sulaiman & Sadiq, 2006) for multi objective functions are filled at this time to for imitates the constrained goal functions given in equation (2.1). Presume we obtained a single value equivalent to each of goal functions of it being optimized individually subject to constraints (2.2) and (2.3) as follows: Max Z1 = 1 Max Z2 = 2 Max Zr = r Min Zr+1 = r+1 Min Zs = s Where i;i=1,2,...,s the decision variable may not of necessity be common to all optimal solutions in the presence of divergences in the middle of goals. But the ordinary set of conclusion variable flanked by object functions is necessary in order to select the best compromise solution. We can determine the common set of decision variable from the following combined goal function. Which formulate the MOLPP given in (2.1) as: For all 0  Zk;k=1,2,...,s. Subject to the same restraint (2.2), (2.3); and the optimum value of functions kR\{0}; where R is the set of real numbers. Now we can solve this MOLPP by Chardra Sen approach (CA). The thought of Multi-Objective Programming (MOP), on the other hand, has turn into well-liked among researchers throughout the past few years due to the information that many single objective optimization methods are not able to help practitioners reach attractive solutions [1-3]. The idea of MOP collective by means of fractional programming is an attractive region of research which incorporates many manufacture planning applications [4-5]. There are a small number of looms have been reported for solving the multiple objective linear fractional programming (MOLFP) problem [6-7]. Multi-objective linear programming is a conservatory of linear programming and it was introduced by Chaudhuri and De [8]. The difficulty was also careful and obtainable a simplex–based answer process to find all weakly well-organized vertices of the increased feasible region [16]. It was though showed that the process suggested by Kormbluth and Steuer for computing

2

space for multiple objectives linear fractional programming with equivalent denominators was given by Tantawy [11], using the thought of duality. The loom enables the conversion of a single intention linear fractional programming difficulty into a linear programming problem with partial fractions technique with the thought of duality.

FUZZY PROGRAMMING FORMULATION OF MOLFPP:

To put together the fuzzy programming model of a MOLFPP, the goal functions) x (Ft (t = 1, 2… p) would be distorted into fuzzy goals by introducing a vague objective level to each of the goal. The optimal solution of each goal function) x (Ft (t = 1, 2… p) when intended in isolation would be considered as the best solution and the linked goal value can be considered as the aspiration level of the corresponding fuzzy goal.

CONCLUSION:

There are several points for prospect investigate in the area of (FMOILFP), in our view, to be deliberate like –

An algorithm is required for solving multi objective integer linear fractional programming problem with fuzzy parameters.

REFERENCES:

[1] D. Dutta, J. R. Rao and R. N.Taiwari, A restricted class of multi objective linear programming problems. European Journal of Operational Research, Vol. 68, (1993), 352-355. [2] D. Dutta, J. R. Rao and R. N.Taiwari, “Fuzzy approaches for multiple criteria linear fractional optimization: a comment”, Fuzzy Sets and Systems Journal, Vol. 54, (1993), 347-349. [3] D. Dutta, J. R. Rao and R. N.Taiwari, “Fuzzy approaches for multiple criteria linear fractional optimization: a comment, fuzzy set theoretic approach. Fuzzy Sets and Systems Journal, Vol.52, (1992), pp. 39-45. [4] M.K. Luhandjula, “Fuzzy approaches for multiple objective linear fractional optimization” Fuzzy Set and System Journal, Vol. 13, (1984), pp. 11–23 [5] I. Nykowski.and Z. Zolkiewski, “A compromise producer for the multi objective linear fractional programming problem. Journal of Operations Research, Vol. 19, (1985), pp. 91-97. [6] A. Azar, D. Andalib and S. H. Mirfakhroddini, “Production planning modeling: A fuzzy multi [7] J. Rezaei and M. Davoodi, “Multi-objective models for lot-sizing with supplier selection. International Journal of Production Economics, Vol.130, (2011), pp. 77–86 [8] A. Chaudhuri and K. De, “Fuzzy multi-objective linear programming for travelling salesman problem’ African Journal of Mathematics and Computer Science Research, Vol.4, No.2, (2011), pp. 64- 70. [9] J. S. H. Kornbluth and R. E. Steuer, “Multiple Linear Fractional Programming, Journal of Management science”, Vol.27, (1987), pp.1024- 1039. [10] H. P. Benson, “Finding Certain Weakly–Efficient Vertices in Multiple Objective Linear Fractional Programming, Journal of Management Science, Vol.31, (1985), pp. 240-245. [11] S.F. Tantawy, “A New Method for Solving Linear Fractional Programming Problems”, Australian Journal of Basic and Applied Sciences, Vol. 1, No. 2, (2007), pp.105-108.