<?xml version="1.0" encoding="utf-8"?>
<journal>
<title>International Journal of Applied Operational Research</title>
<title_fa>ژورنال بین المللی پژوهش عملیاتی</title_fa>
<short_title>International Journal of Applied Operational Research - An Open Access Journal</short_title>
<subject>Basic Sciences</subject>
<web_url>http://ijorlu.lahijan.iau.ir</web_url>
<journal_hbi_system_id>1</journal_hbi_system_id>
<journal_hbi_system_user>admin</journal_hbi_system_user>
<journal_id_issn>2251-6867</journal_id_issn>
<journal_id_issn_online>2251-9432</journal_id_issn_online>
<journal_id_pii>8</journal_id_pii>
<journal_id_doi>7</journal_id_doi>
<journal_id_iranmedex></journal_id_iranmedex>
<journal_id_magiran></journal_id_magiran>
<journal_id_sid>14</journal_id_sid>
<journal_id_nlai>8888</journal_id_nlai>
<journal_id_science>13</journal_id_science>
<language>en</language>
<pubdate>
	<type>jalali</type>
	<year>1395</year>
	<month>8</month>
	<day>1</day>
</pubdate>
<pubdate>
	<type>gregorian</type>
	<year>2016</year>
	<month>11</month>
	<day>1</day>
</pubdate>
<volume>6</volume>
<number>4</number>
<publish_type>online</publish_type>
<publish_edition>1</publish_edition>
<article_type>fulltext</article_type>
<articleset>
	<article>


	<language>en</language>
	<article_id_doi></article_id_doi>
	<title_fa></title_fa>
	<title>A New Method For Solving Linear Bilevel Multi-Objective Multi-Follower Programming Problem</title>
	<subject_fa>تخصصي</subject_fa>
	<subject>Special</subject>
	<content_type_fa>پژوهشي</content_type_fa>
	<content_type>Research</content_type>
	<abstract_fa></abstract_fa>
	<abstract>&lt;p style=&quot;text-align: justify;&quot;&gt;Linear bilevel programming is a decision making problem with a two-level decentralized organization. The leader is in the upper level and the follower, in the lower level. This study addresses linear bilevel multi-objective multi-follower programming (LB-MOMFP) problem, a special case of linear bilevel programming problems with one leader and multiple followers where each decision maker has several objective functions conflicting with each other. We propose a simple and efficient method for solving these problems. In our method, objectives of multi-objective programming problem of the each level decision maker are transformed into fuzzy goals (membership functions) by assigning an aspiration level to each of them, and a max-min decision model is generated for each level problem. Then, we transform obtained linear bilevel multi-follower problem into equivalent single-level problem by extended Karush-Kuhn-Tucker approach. Finally, numerical examples are given to demonstrate the feasibility and efficiency of the proposed method. This paper aims to present a simple technique to obtain better compromise solution of LB-MOMFP problem than earlier techniques. A comparative analysis based on numerical examples is carried out to show preference of the proposed method&lt;/p&gt;

&lt;p style=&quot;margin: 0px;&quot;&gt;&lt;/p&gt;
</abstract>
	<keyword_fa></keyword_fa>
	<keyword>LINEAR BILEVEL PROGRAMMING, MULTI-OBJECTIVE PROGRAMMING,MULTI-FOLLOWER PROGRAMMING,  FUZZY GOAL PROGRAMMING, KARUSH-KUHN-TUKER APPROACH</keyword>
	<start_page>13</start_page>
	<end_page>26</end_page>
	<web_url>http://ijorlu.lahijan.iau.ir/browse.php?a_code=A-10-407-1&amp;slc_lang=en&amp;sid=1</web_url>


<author_list>
	<author>
	<first_name>M.</first_name>
	<middle_name></middle_name>
	<last_name>Habibpoor</last_name>
	<suffix></suffix>
	<first_name_fa></first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa></last_name_fa>
	<suffix_fa></suffix_fa>
	<email>mona.habibpoor@gmail.com</email>
	<code>1003194753284600752</code>
	<orcid>1003194753284600752</orcid>
	<coreauthor>Yes
</coreauthor>
	<affiliation>Department of Mathematics, Shahid Chamran University of Ahvaz, Ahvaz </affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


</author_list>


	</article>
</articleset>
</journal>
