<?xml version="1.0" encoding="UTF-8"?>
<doi_batch version="5.3.1" xmlns="http://www.crossref.org/schema/5.3.1" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:jats="http://www.ncbi.nlm.nih.gov/JATS1" xmlns:ai="http://www.crossref.org/AccessIndicators.xsd" xsi:schemaLocation="http://www.crossref.org/schema/5.3.1 http://www.crossref.org/schema/deposit/crossref5.3.1.xsd">
 <head>
  <doi_batch_id>aspg-21-10-1791475371</doi_batch_id>
  <timestamp>20261008160251</timestamp>
  <depositor>
   <depositor_name>American Scientific Publishing Group</depositor_name>
   <email_address>admin@americaspg.com</email_address>
  </depositor>
  <registrant>American Scientific Publishing Group</registrant>
 </head>
 <body>
  <journal>
   <journal_metadata language="en">
    <full_title>International Journal of Neutrosophic Science</full_title>
    <abbrev_title>IJNS</abbrev_title>
    <issn media_type="print">2692-6148</issn>
    <issn media_type="electronic">2690-6805</issn>
   </journal_metadata>
   <journal_issue>
    <publication_date media_type="online">
     <year>2020</year>
    </publication_date>
    <journal_volume>
     <volume>1</volume>
    </journal_volume>
    <issue>1</issue>
   </journal_issue>
   <journal_article publication_type="full_text">
    <titles>
     <title>A Direct Model for Triangular Neutrosophic Linear Programming</title>
    </titles>
    <contributors>
     <person_name sequence="first" contributor_role="author">
      <given_name>S. A.</given_name>
      <surname>Edalatpanah</surname>
      <affiliations>
       <institution>
        <institution_name>Department of Applied Mathematics, Ayandegan Institute of Higher Education, Tonekabon, Iran</institution_name>
       </institution>
      </affiliations>
     </person_name>
    </contributors>
    <jats:abstract>
     <jats:p>This paper aims to propose a new direct algorithm to solve the neutrosophic linear programming where the variables and right-hand side represented with triangular neutrosophic numbers. The effectiveness of the proposed procedure is illustrated through numerical experiments. The extracted results show that the new algorithm is straightforward and could be useful to guide the modeling and design of a wide range of neutrosophic optimization.</jats:p>
    </jats:abstract>
    <publication_date media_type="online">
     <year>2020</year>
    </publication_date>
    <pages>
     <first_page>19</first_page>
     <last_page>28</last_page>
    </pages>
    <publisher_item>
     <item_number item_number_type="article-number">10</item_number>
    </publisher_item>
    <ai:program name="AccessIndicators">
     <ai:license_ref applies_to="vor">https://creativecommons.org/licenses/by/4.0/</ai:license_ref>
    </ai:program>
    <doi_data>
     <doi>10.54216/IJNS.010104</doi>
     <resource>https://www.americaspg.com/journal/21/article/10</resource>
     <collection property="text-mining">
      <item>
       <resource mime_type="application/pdf">https://www.americaspg.com/storage/1464.pdf</resource>
      </item>
     </collection>
    </doi_data>
   </journal_article>
  </journal>
 </body>
</doi_batch>
