<?xml version="1.0" encoding="utf-8"?>
<journal>
<title>Iranian Journal of Operations Research</title>
<title_fa>مجله انجمن ایرانی تحقیق در عملیات</title_fa>
<short_title>IJOR</short_title>
<subject>Basic Sciences</subject>
<web_url>http://iors.ir/journal</web_url>
<journal_hbi_system_id>0</journal_hbi_system_id>
<journal_hbi_system_user>user</journal_hbi_system_user>
<journal_id_issn>2008-1189</journal_id_issn>
<journal_id_issn_online></journal_id_issn_online>
<journal_id_pii></journal_id_pii>
<journal_id_doi>10.29252/iors</journal_id_doi>
<journal_id_iranmedex></journal_id_iranmedex>
<journal_id_magiran></journal_id_magiran>
<journal_id_sid></journal_id_sid>
<journal_id_nlai></journal_id_nlai>
<journal_id_science></journal_id_science>
<language>en</language>
<pubdate>
	<type>jalali</type>
	<year>1400</year>
	<month>8</month>
	<day>1</day>
</pubdate>
<pubdate>
	<type>gregorian</type>
	<year>2021</year>
	<month>11</month>
	<day>1</day>
</pubdate>
<volume>12</volume>
<number>2</number>
<publish_type>online</publish_type>
<publish_edition>1</publish_edition>
<article_type>fulltext</article_type>
<articleset>
	<article>


	<language>other</language>
	<article_id_doi></article_id_doi>
	<title_fa></title_fa>
	<title>A Wide Neighborhood Primal-dual Predictor-corrector Interior-point Algorithm with New Corrector Directions for Linear Optimization</title>
	<subject_fa>Mathematical Modeling and Applications of OR</subject_fa>
	<subject>Mathematical Modeling and Applications of OR</subject>
	<content_type_fa>پژوهشی</content_type_fa>
	<content_type>Original</content_type>
	<abstract_fa></abstract_fa>
	<abstract>In this paper, we present a new primal-dual predictor-corrector interior-point algorithm for linear optimization problems. In each iteration of this algorithm, we use the new wide neighborhood proposed by Darvay and Tak&amp;aacute;cs. Our algorithm computes the predictor direction, then the predictor direction is used to obtain the corrector direction. We show that the duality gap reduces in both predictor and corrector steps. Moreover, we conclude that the complexity bound of this algorithm coincides with the best-known complexity bound obtained for small neighborhood algorithms. Eventually, numerical results show the capability and efficiency of the proposed algorithm.</abstract>
	<keyword_fa></keyword_fa>
	<keyword>Linear optimization, Interior-point methods, Predictor-corrector methods, Wide neighborhood.</keyword>
	<start_page>130</start_page>
	<end_page>145</end_page>
	<web_url>http://iors.ir/journal/browse.php?a_code=A-10-1422-50&amp;slc_lang=other&amp;sid=1</web_url>


<author_list>
	<author>
	<first_name>Hadis </first_name>
	<middle_name></middle_name>
	<last_name>Abedi </last_name>
	<suffix></suffix>
	<first_name_fa>Hadis</first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa>Abedi</last_name_fa>
	<suffix_fa></suffix_fa>
	<email>hadisa.abd@gmail.com</email>
	<code>1111111111</code>
	<orcid>1111111111</orcid>
	<coreauthor>Yes
</coreauthor>
	<affiliation>Azarbaijan Shahid Madani University</affiliation>
	<affiliation_fa>Azarbaijan Shahid Madani University</affiliation_fa>
	 </author>


	<author>
	<first_name>Behrouz</first_name>
	<middle_name></middle_name>
	<last_name>Kheirfam</last_name>
	<suffix></suffix>
	<first_name_fa>Behrouz</first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa>Kheirfam</last_name_fa>
	<suffix_fa></suffix_fa>
	<email>b.kheirfam@azaruniv.ac.ir</email>
	<code>1111111111</code>
	<orcid>1111111111</orcid>
	<coreauthor>No</coreauthor>
	<affiliation>Azarbaijan Shahid Madani University</affiliation>
	<affiliation_fa>Azarbaijan Shahid Madani University</affiliation_fa>
	 </author>


</author_list>


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