<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">AM</journal-id><journal-title-group><journal-title>Applied Mathematics</journal-title></journal-title-group><issn pub-type="epub">2152-7385</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/am.2015.614208</article-id><article-id pub-id-type="publisher-id">AM-62503</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Physics&amp;Mathematics</subject></subj-group></article-categories><title-group><article-title>
 
 
  Goal Programming for Solving Fractional Programming Problem in Fuzzy Environment
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>nil</surname><given-names>Kumar Nishad</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Shiva</surname><given-names>Raj Singh</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib></contrib-group><aff id="aff1"><addr-line>Department of Mathematics, Banaras Hindu University, Varanasi, India</addr-line></aff><pub-date pub-type="epub"><day>21</day><month>12</month><year>2015</year></pub-date><volume>06</volume><issue>14</issue><fpage>2360</fpage><lpage>2374</lpage><history><date date-type="received"><day>16</day>	<month>October</month>	<year>2015</year></date><date date-type="rev-recd"><day>accepted</day>	<month>28</month>	<year>December</year>	</date><date date-type="accepted"><day>31</day>	<month>December</month>	<year>2015</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  This paper is comprised of the modeling and optimization of a multi objective linear programming problem in fuzzy environment in which some goals are fractional and some are linear. Here, we present a new approach for its solution by using α-cut of fuzzy numbers. In this proposed method, we first define membership function for goals by introducing non-deviational variables for each of objective functions with effective use of α-cut intervals to deal with uncertain parameters being represented by fuzzy numbers. In the optimization process the under deviational variables are minimized for finding a most satisfactory solution. The developed method has also been implemented on a problem for illustration and comparison.
 
</p></abstract><kwd-group><kwd>Fuzzy Sets</kwd><kwd> Trapezoidal Fuzzy Number (TFN)</kwd><kwd> Multi-Objective Linear Programming Problem (MOLPP)</kwd><kwd> Multi-Objective Linear Fractional Programming Problem (MOLFPP)</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>The modeling of a real life optimization problem in general needs to address several objective functions and hence become a multiobjective programming problem in a natural way. The goal programming developed by Charnes and Cooper [<xref ref-type="bibr" rid="scirp.62503-ref1">1</xref>] emerged a powerful tool to solve such multiobjective programming problems. Since commencement of the goal programming technique, it has been enriched by many research workers such as Lee [<xref ref-type="bibr" rid="scirp.62503-ref2">2</xref>] , Ignizio [<xref ref-type="bibr" rid="scirp.62503-ref3">3</xref>] [<xref ref-type="bibr" rid="scirp.62503-ref4">4</xref>] and many more. It undoubtedly established that goal programming has been one of the major breakthroughs in dealing with multi objective linear programming problems but still it fails to deal with situations when parameters are imprecise or vague. On the other hand, the development of fuzzy set by Zadeh [<xref ref-type="bibr" rid="scirp.62503-ref5">5</xref>] motivated Zimmermann [<xref ref-type="bibr" rid="scirp.62503-ref6">6</xref>] to give another approach of solving multi objective programming as fuzzy program- ming. Thus a new dimension of goal programming was introduced as fuzzy goal programming by Narsimhan [<xref ref-type="bibr" rid="scirp.62503-ref7">7</xref>] [<xref ref-type="bibr" rid="scirp.62503-ref8">8</xref>] and Ignigio [<xref ref-type="bibr" rid="scirp.62503-ref4">4</xref>] . However, one of the major problems which are faced by decision makers is the modeling of ill conditioned optimization problems or the problems where the coefficients are imprecise and vague. Thus the classical mathematical programming methods of optimization failed to model such problems. Bellman and Zadeh [<xref ref-type="bibr" rid="scirp.62503-ref9">9</xref>] gave a concept that the constraints and goals in such situations may be viewed as fuzzy sets.</p><p>Further, in many practical optimization problems the decision making becomes further complicated in situations when multiple objectives are conflicting and non commensurate or imprecise in nature. Thus such method based on goal programming needs the additional information from decision makers for priority structure of various goals and their respective aspiration levels. In view of resolving this difficulty of setting appropriate priority and aspiration levels to various objective functions, Mohanty and Vijayraghavan [<xref ref-type="bibr" rid="scirp.62503-ref10">10</xref>] gave a fuzzy approach to multiobjective linear programming problem to get an equivalent goal programming problem by developing a method to compute appropriate priority levels. Kuwano [<xref ref-type="bibr" rid="scirp.62503-ref11">11</xref>] gave a α-optimal solution to fuzzy multiobjective linear programming problem using goal programming approach. At the same time, Chanas and Kuchta [<xref ref-type="bibr" rid="scirp.62503-ref12">12</xref>] also considered the imprecision problem in multi objective optimization by considering interval valued objective functions. The theory of fuzzy goal programming was further enriched by Chen and Tsai [<xref ref-type="bibr" rid="scirp.62503-ref13">13</xref>] , Stancinlesu et al. [<xref ref-type="bibr" rid="scirp.62503-ref14">14</xref>] in view of providing more satisfying solutions. Thus a popular min-max approach in goal programming was studied by Lin [<xref ref-type="bibr" rid="scirp.62503-ref15">15</xref>] , Yaghoobi and Tamiz [<xref ref-type="bibr" rid="scirp.62503-ref16">16</xref>] and Cheng et al. [<xref ref-type="bibr" rid="scirp.62503-ref17">17</xref>] . However, on application side Soliman et al. [<xref ref-type="bibr" rid="scirp.62503-ref18">18</xref>] , Mishra and Singh [<xref ref-type="bibr" rid="scirp.62503-ref19">19</xref>] and Bharati et al. [<xref ref-type="bibr" rid="scirp.62503-ref20">20</xref>] used fuzzy goal programming model in agricultural sector. Recently fuzzy goal programming problems with interval coefficients and interval weights have been studied by Sen and Pal [<xref ref-type="bibr" rid="scirp.62503-ref21">21</xref>] and Hossein Hajiagha [<xref ref-type="bibr" rid="scirp.62503-ref22">22</xref>] . The readers may get a review of linear programming in works of Lotfi et al. [<xref ref-type="bibr" rid="scirp.62503-ref23">23</xref>] and Marbini and Tavana [<xref ref-type="bibr" rid="scirp.62503-ref24">24</xref>] . Recently Cheng [<xref ref-type="bibr" rid="scirp.62503-ref25">25</xref>] used a deviation degree measure of fuzzy numbers and applied a weighted max-min method to solve a fuzzy multi objective linear programming problem.</p><p>In problem of production planning, financial engineering and in several other areas, there are situations where one has to optimize the efficiency of the system, and thus the objective functions become ratio of two objective functions and give rise to fractional programming problem. Further there may be more such fractional objectives and thus may become a multi objective fractional programming problem. Luhandjula [<xref ref-type="bibr" rid="scirp.62503-ref26">26</xref>] gave a fuzzy approach to multi objective linear fractional programming problem in fuzzy environment which has been further developed by Chakraborty and Gupta [<xref ref-type="bibr" rid="scirp.62503-ref27">27</xref>] , Pal et al. [<xref ref-type="bibr" rid="scirp.62503-ref28">28</xref>] , Pop and Minasian [<xref ref-type="bibr" rid="scirp.62503-ref29">29</xref>] and Cui et al. [<xref ref-type="bibr" rid="scirp.62503-ref30">30</xref>] . The subject has been vastly envisaged by several workers and thus various approaches have been developed to solve fractional programming problems by fuzzy goal programming method given by Mehrjerdi [<xref ref-type="bibr" rid="scirp.62503-ref31">31</xref>] , Singh and Kumar [<xref ref-type="bibr" rid="scirp.62503-ref32">32</xref>] , Biswas and Dewan [<xref ref-type="bibr" rid="scirp.62503-ref33">33</xref>] and Ohta and Yamaguchi [<xref ref-type="bibr" rid="scirp.62503-ref34">34</xref>] . The solution of a fractional programming problem with interval valued coefficients has been studied by Pal and Sen [<xref ref-type="bibr" rid="scirp.62503-ref35">35</xref>] and Effati and Pakdaman [<xref ref-type="bibr" rid="scirp.62503-ref36">36</xref>] . Singh et al. [<xref ref-type="bibr" rid="scirp.62503-ref32">32</xref>] considered the solution of a combination of fuzzy multi objective linear programming problem and linear fractional programming problem using a goal programming approach. Thus motivated with above studies, we have extended the work of Ohta and Yamaguchi [<xref ref-type="bibr" rid="scirp.62503-ref34">34</xref>] to solve the fractional goal programming problem with imprecise parameters by computing the appropriate priority and weight to each goals to find optimal solution. The work done has been organized in various sections as follows. Section 2 provides the preliminaries of the subject to make the study self sufficient. Section 3 deals with the a cut presentation of multi objective linear programming problem followed by a cut presentation of linear fractional programming problem with its solution procedure. The methods developed in Sections 3 and 4 have been implemented on a numerical problem given in Section 5 followed by result and discussion placed in Section 6.</p></sec><sec id="s2"><title>2. Preliminaries</title><p>Definition 1. Fuzzy Set</p><p>Let X is a collection of objects denoted by x, then a fuzzy set <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x7.png" xlink:type="simple"/></inline-formula> in X is a set of ordered pairs: <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x8.png" xlink:type="simple"/></inline-formula>, where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x9.png" xlink:type="simple"/></inline-formula> is called the membership function or grade of membership of x in <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x10.png" xlink:type="simple"/></inline-formula> that maps X to the membership space<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x11.png" xlink:type="simple"/></inline-formula>.</p><p>Definition 2. Fuzzy Number</p><p>A Fuzzy set <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x12.png" xlink:type="simple"/></inline-formula> of real line ℝ with membership function <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x13.png" xlink:type="simple"/></inline-formula> is called a fuzzy number, if it holds following axioms.</p><p>1) <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x14.png" xlink:type="simple"/></inline-formula>is normal set.</p><p>2) <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x15.png" xlink:type="simple"/></inline-formula>is convex fuzzy set.</p><p>3) <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x16.png" xlink:type="simple"/></inline-formula>is upper semicontinuous.</p><p>4) <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x17.png" xlink:type="simple"/></inline-formula>is bounded.</p><p>Definition 3. Trapezoidal Fuzzy Number (TFN)</p><p>A trapezoidal fuzzy number with parameters <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x18.png" xlink:type="simple"/></inline-formula> denoted by <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x19.png" xlink:type="simple"/></inline-formula> as given in <xref ref-type="fig" rid="fig1">Figure 1</xref> is a FS on real line ℝ whose membership function is defined as follows:</p><disp-formula id="scirp.62503-formula119"><graphic  xlink:href="http://html.scirp.org/file/14-7402939x20.png"  xlink:type="simple"/></disp-formula><p>If in a trapezoidal FN we take <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x21.png" xlink:type="simple"/></inline-formula> then it becomes a triangular fuzzy number (TFN) with the parameters<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x22.png" xlink:type="simple"/></inline-formula>.Definition 4. α-cut of a fuzzy numberLet <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x23.png" xlink:type="simple"/></inline-formula> be a fuzzy number defined on X and number <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x24.png" xlink:type="simple"/></inline-formula> be any numbers, then α-cut of a fuzzy num-ber is a crisp set and denoted by<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x25.png" xlink:type="simple"/></inline-formula>, is defined as <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x26.png" xlink:type="simple"/></inline-formula> which is a crisp interval.Therefore, a a-cut of a triangular fuzzy number denoted by <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x27.png" xlink:type="simple"/></inline-formula> can be represented by the following interval,<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x28.png" xlink:type="simple"/></inline-formula>It is important to note that if we put <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x29.png" xlink:type="simple"/></inline-formula> then, above fuzzy number turns out to be a crisp real number.Definition 5. α-cut of a LR-fuzzy numberLet <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x30.png" xlink:type="simple"/></inline-formula> be a LR-fuzzy number denoted by<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x30.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x31.png" xlink:type="simple"/></inline-formula>, then its α-cut is defined as <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x21.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x22.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x30.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x31.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x32.png" xlink:type="simple"/></inline-formula> which is a crisp interval.3. Multi-Objective Goal Programming Formulation with α Cut of the Fuzzy NumbersLet us consider a multi-objective optimization problem with n decision variables, m constraints and k objective functions,</p><disp-formula id="scirp.62503-formula120"><label>(1)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x33.png"  xlink:type="simple"/></disp-formula><fig-group id="fig1"><label><xref ref-type="fig" rid="fig1">Figure 1</xref></label><caption><title> Membership function of TFN.</title></caption><fig id ="fig1_1"><label></label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/14-7402939x34.png"/></fig></fig-group><p>where<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x35.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x36.png" xlink:type="simple"/></inline-formula>and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x37.png" xlink:type="simple"/></inline-formula> are n dimensional and m dimensional vectors respectively, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x37.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x38.png" xlink:type="simple"/></inline-formula>is a m &#180; n matrix with fuzzy parameter and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x37.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x38.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x39.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x35.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x37.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x38.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x39.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x40.png" xlink:type="simple"/></inline-formula> are fuzzy numbers. Since the above problem (1) have fuzzy coefficients which have possibilistic distribution in an uncertain intervals and hence may be approximated in terms of its α-cut intervals.</p><p>Let <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x41.png" xlink:type="simple"/></inline-formula> be α-cut interval of fuzzy number <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x41.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x42.png" xlink:type="simple"/></inline-formula> defined by the definition (4)<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x41.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x42.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x43.png" xlink:type="simple"/></inline-formula>.</p><p>Where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x44.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x44.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x45.png" xlink:type="simple"/></inline-formula> are the lower and upper bound of the α-cut interval <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x44.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x45.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x46.png" xlink:type="simple"/></inline-formula> of fuzzy number. Since <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x44.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x45.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x46.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x47.png" xlink:type="simple"/></inline-formula> the coefficients of the objective function are fuzzy numbers, α-cut interval of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x44.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x45.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x46.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x47.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x48.png" xlink:type="simple"/></inline-formula> can be defined as</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x49.png" xlink:type="simple"/></inline-formula>,</p><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x50.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x50.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x51.png" xlink:type="simple"/></inline-formula> is given as in definition of α-cut interval. Thus <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x50.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x51.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x52.png" xlink:type="simple"/></inline-formula> can be represented as a closed interval<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x50.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x51.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x52.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x53.png" xlink:type="simple"/></inline-formula>, such that<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x50.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x51.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x52.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x53.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x54.png" xlink:type="simple"/></inline-formula>.</p><p>Now the lower and upper bound for the respective α-cut intervals of the objective function are defined as</p><disp-formula id="scirp.62503-formula121"><label>(2)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x55.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.62503-formula122"><label>. (3)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x56.png"  xlink:type="simple"/></disp-formula><p>In the next step, we to construct a membership function for the maximization type objective function<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x57.png" xlink:type="simple"/></inline-formula>, and can be replaced by the upper bound of its α-cut interval i.e.</p><disp-formula id="scirp.62503-formula123"><label>. (4)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x58.png"  xlink:type="simple"/></disp-formula><p>Similarly to construct a membership function for minimization type objective function<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x59.png" xlink:type="simple"/></inline-formula>, and can be replaced by the lower bound of its α-cut interval that is</p><disp-formula id="scirp.62503-formula124"><label>. (5)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x60.png"  xlink:type="simple"/></disp-formula><p>And the constraint inequalities</p><disp-formula id="scirp.62503-formula125"><label>(6)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x61.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.62503-formula126"><label>(7)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x62.png"  xlink:type="simple"/></disp-formula><p>can be written in terms of α-cut values as</p><disp-formula id="scirp.62503-formula127"><graphic  xlink:href="http://html.scirp.org/file/14-7402939x63.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.62503-formula128"><graphic  xlink:href="http://html.scirp.org/file/14-7402939x64.png"  xlink:type="simple"/></disp-formula><p>and the fuzzy equality constraint</p><disp-formula id="scirp.62503-formula129"><label>(8)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x65.png"  xlink:type="simple"/></disp-formula><p>can be transformed into two inequalities as</p><disp-formula id="scirp.62503-formula130"><graphic  xlink:href="http://html.scirp.org/file/14-7402939x66.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.62503-formula131"><graphic  xlink:href="http://html.scirp.org/file/14-7402939x67.png"  xlink:type="simple"/></disp-formula><p>Thus the undertaken maximization problem is transformed in to the following multi objective linear programming problem (MOLPP) as</p><disp-formula id="scirp.62503-formula132"><label>(9)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x68.png"  xlink:type="simple"/></disp-formula><p>Now consider the transformation of objectives to fuzzy goals by means of assigning an aspiration level to each of them. Thus applying the goal programming approach, the problem (9) can be transformed in to fuzzy goals by taking certain aspiration levels and introducing under deviational variables to each of the objective functions. In proposed method the above maximization type objective function, is transformed as</p><disp-formula id="scirp.62503-formula133"><label>(10)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x69.png"  xlink:type="simple"/></disp-formula><p>where<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x70.png" xlink:type="simple"/></inline-formula>, is under deviational variables and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x70.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x71.png" xlink:type="simple"/></inline-formula> is aspiration level for the k<sup>th</sup> goal and the highest acceptable level for the k<sup>th</sup> goal and the lowest acceptable level <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x70.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x71.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x72.png" xlink:type="simple"/></inline-formula> are ideal and anti-ideal solutions and are computed as for appropriate values of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x70.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x71.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x72.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x73.png" xlink:type="simple"/></inline-formula></p><disp-formula id="scirp.62503-formula134"><label>(11)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x74.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.62503-formula135"><label>(12)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x75.png"  xlink:type="simple"/></disp-formula><p>Now using min-sum goal programming method, the above fuzzy goal programming problem is converted in to single objective linear programming problem as follows.</p><p>Find <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x76.png" xlink:type="simple"/></inline-formula> so as to</p><disp-formula id="scirp.62503-formula136"><label>(13)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x77.png"  xlink:type="simple"/></disp-formula><p>Here, Z represents the achievement function and the weights w<sub>k</sub> attached to the under deviational variables<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x78.png" xlink:type="simple"/></inline-formula>, an</p><disp-formula id="scirp.62503-formula137"><label>(14)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x79.png"  xlink:type="simple"/></disp-formula></sec><sec id="s3"><title>4. Fractional Goal Programming Formulation with α-Cut of the Fuzzy Parameters</title><p>Let us consider a fractional optimization problem with n decision variables, m constraints and</p><disp-formula id="scirp.62503-formula138"><label>(15)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x80.png"  xlink:type="simple"/></disp-formula><p>where<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x81.png" xlink:type="simple"/></inline-formula>, and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x81.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x82.png" xlink:type="simple"/></inline-formula> are n dimensional and m dimensional vectors respectively, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x81.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x82.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x83.png" xlink:type="simple"/></inline-formula>is a m &#180; n matrix with fuzzy parameter, and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x81.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x82.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x83.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x84.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x81.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x82.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x83.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x84.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x85.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x81.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x82.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x83.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x84.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x86.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x81.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x82.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x83.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x84.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x87.png" xlink:type="simple"/></inline-formula>and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x81.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x82.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x83.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x84.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x85.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x87.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x88.png" xlink:type="simple"/></inline-formula> are fuzzy numbers.</p><p>It is also to assume that<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x89.png" xlink:type="simple"/></inline-formula>.</p><p>Since, above problem (15) have fuzzy coefficients which have possibilistic distribution in an uncertain intervals and hence the problem can be written in terms of its α-cut intervals.</p><p>Now the lower and upper bound for the respective α-cut intervals of the objective function are defined as</p><disp-formula id="scirp.62503-formula139"><label>(16)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x90.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.62503-formula140"><label>. (17)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x91.png"  xlink:type="simple"/></disp-formula><p>In the next step, we to construct a membership function for the maximization type objective function<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x92.png" xlink:type="simple"/></inline-formula>, and can be replaced by the upper bound of its α-cut interval i.e.</p><disp-formula id="scirp.62503-formula141"><label>(18)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x93.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.62503-formula142"><label>(19)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x94.png"  xlink:type="simple"/></disp-formula><p>Similarly we construct a membership function for minimization type objective function<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x95.png" xlink:type="simple"/></inline-formula>, and can be obtained by replacing the upper bound by lower bound of its α-cut interval as</p><disp-formula id="scirp.62503-formula143"><label>(20)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x96.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.62503-formula144"><label>(21)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x97.png"  xlink:type="simple"/></disp-formula><p>And the constraint inequalities and equalities are transformed as defined in the Equation (6), (7) and (8).</p><p>Now the undertaken maximization problem is transformed in to the following linear programming problem (LPP) as</p><disp-formula id="scirp.62503-formula145"><label>(22)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x98.png"  xlink:type="simple"/></disp-formula><p>Further consider the conversion of objectives to fuzzy goals by means of assigning an aspiration level to the objective function. Thus applying the goal programming method, the problem (22) can be transformed in to fuzzy goal by taking certain aspiration levels and introducing under deviational variables to the objective function. In proposed method the above maximization type objective function, is transformed as</p><disp-formula id="scirp.62503-formula146"><label>(23)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x99.png"  xlink:type="simple"/></disp-formula><p>where<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x100.png" xlink:type="simple"/></inline-formula>, is under deviational variables and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x100.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x101.png" xlink:type="simple"/></inline-formula> is aspiration level for the k<sup>th</sup> objective goal and the highest acceptable level for the objective goal and the lowest acceptable level <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x100.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x101.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x102.png" xlink:type="simple"/></inline-formula> are ideal and anti-ideal solutions and are computed as for appropriate values of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x100.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x101.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x102.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x103.png" xlink:type="simple"/></inline-formula></p><disp-formula id="scirp.62503-formula147"><label>(24)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x104.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.62503-formula148"><label>(25)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x105.png"  xlink:type="simple"/></disp-formula><p>Now using min-sum goal programming method, the above fuzzy goal programming problem is converted in to single objective linear programming problem as follows.</p><p>Find <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x106.png" xlink:type="simple"/></inline-formula> so as to</p><disp-formula id="scirp.62503-formula149"><label>(26)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x107.png"  xlink:type="simple"/></disp-formula><p>Here Z represents the achievement function and the weights <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x108.png" xlink:type="simple"/></inline-formula> attached to the under deviational variable<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x108.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x109.png" xlink:type="simple"/></inline-formula>, and are defined as in Equation (14).</p>Linearization of Membership Goal<p>For simplicity to solve the problem (27) we linearize the membership goal which is non-linear in nature and can be write in the following form</p><disp-formula id="scirp.62503-formula150"><label>(27)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x110.png"  xlink:type="simple"/></disp-formula><p>where<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x111.png" xlink:type="simple"/></inline-formula>.</p><p>Introducing the expression of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x112.png" xlink:type="simple"/></inline-formula> from Equation (18), the above goal can be written as</p><disp-formula id="scirp.62503-formula151"><label>(28)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x113.png"  xlink:type="simple"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x114.png" xlink:type="simple"/></inline-formula> and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x114.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x115.png" xlink:type="simple"/></inline-formula>.</p><p>Now by using the method of variable change given by Kornbluth and Steuer [<xref ref-type="bibr" rid="scirp.62503-ref36">36</xref>] the goal in the expression (28) can be linearized as follows.</p><p>Let<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x116.png" xlink:type="simple"/></inline-formula>, then the linear form of the (28) can be written as</p><disp-formula id="scirp.62503-formula152"><label>(29)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x117.png"  xlink:type="simple"/></disp-formula><p>with <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x118.png" xlink:type="simple"/></inline-formula> and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x118.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x119.png" xlink:type="simple"/></inline-formula>.</p><p>Now in decision making, to minimize the negative deviational variable <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x120.png" xlink:type="simple"/></inline-formula> in the expression (27) means we are going to maximize the membership goal function, and also minimize <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x120.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x121.png" xlink:type="simple"/></inline-formula> which is a non linear term.</p><p>It may be noted that when membership goal is fully achieved, the value of negative deviational variable becomes zero (<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x122.png" xlink:type="simple"/></inline-formula>), and when achievement of membership goal is zero at this time value of negative deviational variable is one (<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x122.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x123.png" xlink:type="simple"/></inline-formula>) for k<sup>th</sup> objective. The involvement of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x122.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x123.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x124.png" xlink:type="simple"/></inline-formula> in the solution leads to impose the following constraints to model the problem</p><disp-formula id="scirp.62503-formula153"><label>. (30)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x125.png"  xlink:type="simple"/></disp-formula><p>Now for a given value of α, under the framework of Goal Programming, (min-sum Goal programming) [<xref ref-type="bibr" rid="scirp.62503-ref10">10</xref>] , the problem under consideration can be presented as.</p><p>Find X so as to</p><disp-formula id="scirp.62503-formula154"><label>(31)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x126.png"  xlink:type="simple"/></disp-formula><p>Here Z represents the achievement function and the weights w<sub>i</sub> attached to the under deviational variable<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x127.png" xlink:type="simple"/></inline-formula>, and are defined as in Equation (14).</p></sec><sec id="s4"><title>5. Numerical Illustration</title><p>In view of illustrating the developed method in previous section, we consider the modelling and optimization of a problem of electronic component maker dealing in domestic and overseas markets as undertaken by Ohta and Yamaguchi [<xref ref-type="bibr" rid="scirp.62503-ref18">18</xref>] . The company wishes to make a mid-term production plan for three months. The company has two types of products, A and B, estimated and anticipated prices and expected gross margins products are shown in <xref ref-type="table" rid="table1">Table 1</xref>. The time required for individual products in the process and amount used of the principle materials are shown in <xref ref-type="table" rid="table2">Table 2</xref> with amount of the expected demand shown in <xref ref-type="table" rid="table3">Table 3</xref>.</p><p>The company cherishes the idea of determine the Amount of production which satisfies the following goals and other fuzzy number with good balance as shown in <xref ref-type="table" rid="table4">Table 4</xref>.</p><p>Supposing that the amount of domestic production is x<sub>1</sub> and the amount of overseas production is x<sub>2</sub> for product A and the amount of domestic production is x<sub>3</sub> and the amount of overseas production is x<sub>4</sub> for product B. Now using data from <xref ref-type="table" rid="table1">Table 1</xref> to <xref ref-type="table" rid="table4">Table 4</xref>, the mathematical formulation for all the fuzzy goals of the under taken problem of production system are as follows.</p><table-wrap id="table1" ><label><xref ref-type="table" rid="table1">Table 1</xref></label><caption><title> Price and grass margin of each product ($)</title></caption><table><tbody><thead><tr><th align="center" valign="middle" ></th><th align="center" valign="middle" >Product A</th><th align="center" valign="middle" >Product B</th></tr></thead><tr><td align="center" valign="middle" >Price</td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td></tr><tr><td align="center" valign="middle" >Domestic</td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x128.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x129.png" xlink:type="simple"/></inline-formula></td></tr><tr><td align="center" valign="middle" >Overseas</td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x130.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x131.png" xlink:type="simple"/></inline-formula></td></tr><tr><td align="center" valign="middle" >Grassmargin</td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td></tr><tr><td align="center" valign="middle" >Domestic</td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x132.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x133.png" xlink:type="simple"/></inline-formula></td></tr><tr><td align="center" valign="middle" >Overseas</td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x134.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x135.png" xlink:type="simple"/></inline-formula></td></tr></tbody></table></table-wrap><table-wrap id="table2" ><label><xref ref-type="table" rid="table2">Table 2</xref></label><caption><title> The time required in the process (hours) and principle materials (units)</title></caption><table><tbody><thead><tr><th align="center" valign="middle" ></th><th align="center" valign="middle" >Product A</th><th align="center" valign="middle" >Product B</th></tr></thead><tr><td align="center" valign="middle" >Process</td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x136.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x137.png" xlink:type="simple"/></inline-formula></td></tr><tr><td align="center" valign="middle" >Materials</td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x138.png" xlink:type="simple"/></inline-formula></td><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x139.png" xlink:type="simple"/></inline-formula></td></tr></tbody></table></table-wrap><table-wrap id="table3" ><label><xref ref-type="table" rid="table3">Table 3</xref></label><caption><title> Expected demand</title></caption><table><tbody><thead><tr><th align="center" valign="middle" ></th><th align="center" valign="middle" >Product A</th><th align="center" valign="middle" >Product B</th></tr></thead><tr><td align="center" valign="middle" >Domestic</td><td align="center" valign="middle" >720 - 780</td><td align="center" valign="middle" >420 - 480</td></tr><tr><td align="center" valign="middle" >Overseas</td><td align="center" valign="middle" >900 - 1200</td><td align="center" valign="middle" >600 - 800</td></tr></tbody></table></table-wrap><table-wrap id="table4" ><label><xref ref-type="table" rid="table4">Table 4</xref></label><caption><title> Aspiration levels of goals and other fuzzy numbers</title></caption><table><tbody><thead><tr><th align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x140.png" xlink:type="simple"/></inline-formula></th></tr></thead><tr><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x141.png" xlink:type="simple"/></inline-formula></td></tr><tr><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x142.png" xlink:type="simple"/></inline-formula></td></tr><tr><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x143.png" xlink:type="simple"/></inline-formula></td></tr><tr><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x144.png" xlink:type="simple"/></inline-formula></td></tr><tr><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x145.png" xlink:type="simple"/></inline-formula></td></tr><tr><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x146.png" xlink:type="simple"/></inline-formula></td></tr><tr><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x147.png" xlink:type="simple"/></inline-formula></td></tr><tr><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x148.png" xlink:type="simple"/></inline-formula></td></tr><tr><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x149.png" xlink:type="simple"/></inline-formula></td></tr><tr><td align="center" valign="middle" ><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x150.png" xlink:type="simple"/></inline-formula></td></tr></tbody></table></table-wrap><disp-formula id="scirp.62503-formula155"><label>(32)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x151.png"  xlink:type="simple"/></disp-formula><p>Solving the above problem by proposed method as described in section 2, first we replace the fuzzy numbers in coefficients by their α-cuts and thus above multi-objective linear fractional programming problem (32) is transformed into the following problem</p><disp-formula id="scirp.62503-formula156"><label>(33)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x152.png"  xlink:type="simple"/></disp-formula><p>Now to consider the solution of above problem (33), we apply the developed fuzzy fractional goal programming method developed in section 4 and 5 and consider its solution for<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x153.png" xlink:type="simple"/></inline-formula>, and compute various required parameters. Aspiration level of fraction goal (Z<sub>1</sub> and Z<sub>2</sub>) is given as<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x153.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x154.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x153.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x154.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x155.png" xlink:type="simple"/></inline-formula>and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x153.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x154.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x155.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x156.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x153.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x154.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x155.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x156.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x157.png" xlink:type="simple"/></inline-formula>and weight of fraction goal is calculated as defined in (14) i.e.<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x153.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x154.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x155.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x156.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x157.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x158.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x153.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x154.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x155.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x156.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x157.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x158.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x159.png" xlink:type="simple"/></inline-formula>, We also compute <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x153.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x154.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x155.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x156.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x157.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x158.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x159.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x160.png" xlink:type="simple"/></inline-formula> (i = 3, 4, 5) for other linear goals as defined in (14), and aspiration level for other goals <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x153.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x154.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x155.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x156.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x157.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x158.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x159.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x160.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x161.png" xlink:type="simple"/></inline-formula> (i = 3, 4, 5) is given in <xref ref-type="table" rid="table3">Table 3</xref>. Now on implementation levels and weight to the goals, the above fractional programming problem can be equivalently written in linear programming problem given as below.</p><disp-formula id="scirp.62503-formula157"><label>(34)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/14-7402939x162.png"  xlink:type="simple"/></disp-formula><p>where</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x163.png" xlink:type="simple"/></inline-formula>and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x163.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x164.png" xlink:type="simple"/></inline-formula>.</p><p>The above linear programming problem (34) has been solved by the MATLAB<sup>&#174;</sup>, and optimal solution for decision variables are obtained as</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/14-7402939x165.png" xlink:type="simple"/></inline-formula>.</p><p>And the values of objective functions are Z<sub>1</sub> = 0.149 or 14.9%, Z<sub>2</sub> = 0.713 or 71.3%, Z<sub>3</sub> = 15885.52, Z<sub>4</sub> = 604.04, Z<sub>5</sub> = 18447.96.</p></sec><sec id="s5"><title>6. Results and Discussion</title><p>The developed method uses the a-cut representation of fuzzy numbers which deals with imprecision in optimization problem. We compare the results obtained by the proposed method with the results of Ohta and Yamaguchi [<xref ref-type="bibr" rid="scirp.62503-ref33">33</xref>] in terms of satisfaction of various goals. The achievements of various goals by method of Ohta and Yamaguchi are Z<sub>1</sub> = 13.53%, Z<sub>2</sub> = 64.99%, Z<sub>3</sub> = (14504.9, 15003.7), Z<sub>4</sub> = (580.8, 586.8), Z<sub>5</sub> = (18082.21, 18383.8), whereas by the proposed method the achievements of goal are Z<sub>1</sub> = 14.9%, Z<sub>2</sub> = 71.3%, Z<sub>3</sub> = 15885.52, Z<sub>4</sub> = 604.04, Z<sub>5</sub> = 18447.96. Clearly the level of satisfaction of each goal by the proposed method is higher than the previous results. The proposed method has a further advantage that in general it is a difficult task to set priority weight for various goals in multi-objective programming problem. The situation becomes more tedious when the goals are conflicting in nature. It is hard to set a definite weight for a fractional goal obtained in modeling by taking the ratio of two objective functions. The proposed method also computes the appropriate weight to each goal and hence provides a better solution.</p><p>Thus for modeling the optimization problems having vagueness and imprecision in information with fuzzy optimization approach various methods are available in literature for various situations. The fuzzy optimization problems are classified in various categories, such as problems with fuzzy coefficients in constraints, fuzzy coefficients in objective functions and problems with fuzzy inequalities. The proposed method is more suitable to find the optimal solutions of the problems having L-R number fuzzy coefficients to various field of production planning problem, transportation problem, and other real world multi-objective programming problems.</p></sec><sec id="s6"><title>Cite this paper</title><p>Anil KumarNishad,Shiva RajSingh, (2015) Goal Programming for Solving Fractional Programming Problem in Fuzzy Environment. Applied Mathematics,06,2360-2374. doi: 10.4236/am.2015.614208</p></sec><sec id="s7"><title>NOTES</title></sec></body><back><ref-list><title>References</title><ref id="scirp.62503-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Charnes, A. and Cooper, W.W. (1968) Management Models of Industrial Applications of Linear Program. Vol. 1-2, Wiley, New York.</mixed-citation></ref><ref id="scirp.62503-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Lee, S.M. (1972) Goal Programming for Decision Analysis. Auerbach Publishers, Philadelphia.</mixed-citation></ref><ref id="scirp.62503-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Ignizio, J.P. (1976) Goal Programming and Extensions. D.C. Heath, Lexington.</mixed-citation></ref><ref id="scirp.62503-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Ignizio, J.P. (1982) Notes and Communications on the (Re)Discovery of Fuzzy Goal Programming. Decision Sciences, 13, 331-336. http://dx.doi.org/10.1111/j.1540-5915.1982.tb00152.x</mixed-citation></ref><ref id="scirp.62503-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Zadeh, L.A. (1965) Fuzzy Sets. Information and Control, 8, 338-353.  
http://dx.doi.org/10.1016/S0019-9958(65)90241-X</mixed-citation></ref><ref id="scirp.62503-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Zimmermann, H.J. (1978) Fuzzy Programming and Linear Programming with Several Objective Functions. Fuzzy Sets and Systems, 1, 45-55. http://dx.doi.org/10.1016/0165-0114(78)90031-3</mixed-citation></ref><ref id="scirp.62503-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Narasimhan, R. (1980) Goal Programming in a Fuzzy Environment. Decision Science, 11, 325-336. 
http://dx.doi.org/10.1111/j.1540-5915.1980.tb01142.x</mixed-citation></ref><ref id="scirp.62503-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Narasimhan, R. (1981) On Fuzzy Goal Programming-Some Comments. Decision Science, 12, 532-538. 
http://dx.doi.org/10.1111/j.1540-5915.1981.tb00103.x</mixed-citation></ref><ref id="scirp.62503-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Bellman, R.E. and Zadeh, L.A. (1970) Decision Making in a Fuzzy Environment. Management Sciences, 17, 141-164. 
http://dx.doi.org/10.1287/mnsc.17.4.B141</mixed-citation></ref><ref id="scirp.62503-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Mohanty, B.K. and Vijayaraghawan, T.A.S. (1995) A Multiobjective Programming Problem and Its Equivalent Goal Programming Problem with Approprite Priorities and Aspiration Levels: A Fuzzy Approach. Computers &amp; Operations Research, 22, 771-778. http://dx.doi.org/10.1016/0305-0548(94)00066-H</mixed-citation></ref><ref id="scirp.62503-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Kuwano, H. (1996) On the Fuzzy Multi-Objective Linear Programming Problems: Goal Programming Approach. Fuzzy Sets and Systems, 82, 57-64. http://dx.doi.org/10.1016/0165-0114(95)00231-6</mixed-citation></ref><ref id="scirp.62503-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">Chanas, A. and Kuchta, D. (1996) Multiobjective Programming in Optimization of Interval Objective Functions—A Generalized Approach. European Journal of Operational Research, 94, 594-598.  
http://dx.doi.org/10.1016/0377-2217(95)00055-0</mixed-citation></ref><ref id="scirp.62503-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">Chen, L.H. and Tsai, F.C. (2001) Fuzzy Goal Programming with Different Importance and Priorties. European Journal of Operational Research, 133, 548-556. http://dx.doi.org/10.1016/S0377-2217(00)00201-0</mixed-citation></ref><ref id="scirp.62503-ref14"><label>14</label><mixed-citation publication-type="other" xlink:type="simple">Stanciulescu, C., Fortemps, P., Installe, M. and Wertz, V. (2003) Multi-Objective Fuzzy Linear Programming Problems with Fuzzy Decision Variables. European Journal of Operational Research, 149, 654-675.  
http://dx.doi.org/10.1016/S0377-2217(02)00449-6</mixed-citation></ref><ref id="scirp.62503-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">Lin, C.C. (2004) A Weighted Max-Min Model Fuzzy Goal Programming. Fuzzy Sets and Systems, 142, 407-420.  
http://dx.doi.org/10.1016/S0165-0114(03)00092-7</mixed-citation></ref><ref id="scirp.62503-ref16"><label>16</label><mixed-citation publication-type="other" xlink:type="simple">Yaghoobi, M.A. and Tamiz, M. (2007) A Method for Solving Fuzzy Goal Programming Problems Based on MINMAX Approach. European Journal of Operational Research, 177, 1580-1590.</mixed-citation></ref><ref id="scirp.62503-ref17"><label>17</label><mixed-citation publication-type="other" xlink:type="simple">Cheng, H.F., Huang, W.L., Zhon, Q. and Cai, J. (2013) Solving Fuzzy Multiobjective Linear Programming Problems Using Deviation Degree Measures and Max-Min Method. Applied Mathematical Modeling, 73, 6855-6869.  
http://dx.doi.org/10.1016/j.apm.2013.01.048</mixed-citation></ref><ref id="scirp.62503-ref18"><label>18</label><mixed-citation publication-type="other" xlink:type="simple">Soliman, O., Sarker Rahul, A. and Zahir, S. (2008) Fuzzy Goal Programming Model with Parametric Analysis for Regional Sustainability Development under Climate Change: A Case of Agriculture Sector. ASOR Bulletin, 27, 2-15.</mixed-citation></ref><ref id="scirp.62503-ref19"><label>19</label><mixed-citation publication-type="other" xlink:type="simple">Mishra, B. and Singh, S.R. (2013) Linear Fractional Programming Procedure for Multi Objective Linear Programming Problem in Agriculture System. International Journal of Computer Applications, 61, 45-52.</mixed-citation></ref><ref id="scirp.62503-ref20"><label>20</label><mixed-citation publication-type="book" xlink:type="simple">Bharati, S.K., Nishad, A.K. and Singh, S.R. (2014) Solution of Multi-Objective Linear Programming under Intuitionistic Fuzzy Environment. In: Babu, B.V., Nagar, A., Deep, K., Pant, M., Bansal, J.C., Ray, K. and Gupta, U., Eds., Proceedings of the Second International Conference on Soft Computing for Problem Solving (SocProS 2012), December 28-30, 2012, Advances in Intelligent Systems and Computing, Vol. 236, Springer India, New Delhi, 161-171.  
http://dx.doi.org/10.1007/978-81-322-1602-5_18</mixed-citation></ref><ref id="scirp.62503-ref21"><label>21</label><mixed-citation publication-type="other" xlink:type="simple">Sen, S. and Pal, B.B. (2013) Interval Goal Programming Approach to Multiobjective Fuzzy Goal Programming Problems with Interval Weights. Procedia Technology, 10, 587-595. http://dx.doi.org/10.1016/j.protcy.2013.12.399</mixed-citation></ref><ref id="scirp.62503-ref22"><label>22</label><mixed-citation publication-type="other" xlink:type="simple">Seyed, H. and Razavi, H. (2013) Multi-Objective Linear Programming with Interval Coefficients: A Fuzzy Set Based Approach. Emerald, 42, 482-496.</mixed-citation></ref><ref id="scirp.62503-ref23"><label>23</label><mixed-citation publication-type="other" xlink:type="simple">Azzabi, L., Dorra, A., Kaddour, B. and Abdessamad, K. (2014) Fuzzy Goal Programming to Optimization the Multi-Objective Problem. Science Journal of Applied Mathematics and Statistics, 2, 14-19.  
http://dx.doi.org/10.11648/j.sjams.20140201.12</mixed-citation></ref><ref id="scirp.62503-ref24"><label>24</label><mixed-citation publication-type="other" xlink:type="simple">Marbini, A.H. and Tavana, M. (2011) An Extension of the Linear Programming Method with Fuzzy Parameters. International Journal of Mathematics in Operational Research, 3, 44-55.</mixed-citation></ref><ref id="scirp.62503-ref25"><label>25</label><mixed-citation publication-type="other" xlink:type="simple">Luhandjula, M.K. (1984) Fuzzy Approaches for Multiple Objective Linear Fractional Optimization. Fuzzy Sets and Systems, 13, 11-23. http://dx.doi.org/10.1016/0165-0114(84)90023-X</mixed-citation></ref><ref id="scirp.62503-ref26"><label>26</label><mixed-citation publication-type="other" xlink:type="simple">Chakraborty, M. and Gupta, S. (2002) Fuzzy Mathematical Programming for Multi Objective Linear Fractional Programming Problem. Fuzzy Sets and Systems, 125, 335-342. http://dx.doi.org/10.1016/S0165-0114(01)00060-4</mixed-citation></ref><ref id="scirp.62503-ref27"><label>27</label><mixed-citation publication-type="other" xlink:type="simple">Pal, B.B., Moitra, B.N. and Maulik, U. (2003) A Goal Programming Procedure for Fuzzy Multiobjective Linear Fractional Programming Problem. Fuzzy Sets and Systems, 139, 395-405.  
http://dx.doi.org/10.1016/S0165-0114(02)00374-3</mixed-citation></ref><ref id="scirp.62503-ref28"><label>28</label><mixed-citation publication-type="other" xlink:type="simple">Pop, B., Minasian, I. and Stancu, M. (2008) A Method of Solving Fully Fuzzified Linear Fractional Programming Problems. Journal of Applied Mathematics and Computing, 27, 227-242. http://dx.doi.org/10.1007/s12190-008-0052-5</mixed-citation></ref><ref id="scirp.62503-ref29"><label>29</label><mixed-citation publication-type="other" xlink:type="simple">Cui, Y.H., Qu, J., Peng, Y., Wang, L. and Li, B. (2010) The Study of the Solution on Multi-Objective Linear Programming Problem under Fuzzy. 2010 Asia-Pacific Conference on Wearable Computing Systems (APWCS), Shenzhen, 17-18 April 2010, 286-290. http://dx.doi.org/10.1109/APWCS.2010.79</mixed-citation></ref><ref id="scirp.62503-ref30"><label>30</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Mehrjerdi</surname><given-names> Y.Z. </given-names></name>,<etal>et al</etal>. (<year>2011</year>)<article-title>Solving Fractional Programming Problem through Fuzzy Goal Setting and Approximation</article-title><source> Applied Soft Computing</source><volume> 11</volume>,<fpage> 1735</fpage>-<lpage>1742</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.62503-ref31"><label>31</label><mixed-citation publication-type="other" xlink:type="simple">Pitam, S., Kumar, S.D. and Singh, R.K. (2011) Fuzzy Multiobjective Linear plus Linear Fractional Programming Problem: Approximation and Goal Programming Approach. International Journal of Mathematics and Computers in Simulation, 5, 395-404.</mixed-citation></ref><ref id="scirp.62503-ref32"><label>32</label><mixed-citation publication-type="other" xlink:type="simple">Animesh, B. and Dewan, S. (2012) Priority Based Fuzzy Goal Programming Technique to Fractional Fuzzy Goals Using Dynamic Programming. Fuzzy Information and Engineering, 4, 165-180.</mixed-citation></ref><ref id="scirp.62503-ref33"><label>33</label><mixed-citation publication-type="other" xlink:type="simple">Ohta, H. and Yamaguchi, T. (1996) Linear Fractional Goal Programming in Consideration of Fuzzy Solution. European Journal of Operation Research, 92, 157-165. http://dx.doi.org/10.1016/0377-2217(95)00052-6</mixed-citation></ref><ref id="scirp.62503-ref34"><label>34</label><mixed-citation publication-type="other" xlink:type="simple">Pal, B.B. and Sen, S. (2008) A Goal Programming Procedure for Solving Interval Valued Multi-Objective Fractional Programming Problems. 16th International Conference on Advanced Computing and Communications, ADCOM 2008, Chennai, 14-17 December 2008, 297-302.</mixed-citation></ref><ref id="scirp.62503-ref35"><label>35</label><mixed-citation publication-type="other" xlink:type="simple">Sohrab, E. and Morteza, P. (2012) Solving the Interval Valued Linear Programming Problem. American Journal of Computational Mathematics, 2, 51-55. http://dx.doi.org/10.4236/ajcm.2012.21006</mixed-citation></ref><ref id="scirp.62503-ref36"><label>36</label><mixed-citation publication-type="other" xlink:type="simple">Kornbluth, J.S.H. and Steuer, R.E. (1981) Multiple Objective Linear Fractional Programming. Management Science, 27, 1024-1039. http://dx.doi.org/10.1287/mnsc.27.9.1024</mixed-citation></ref></ref-list></back></article>