<?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-34-2233-1791482497</doi_batch_id>
  <timestamp>20261008180137</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>Prospects for Applied Mathematics and Data Analysis</full_title>
    <abbrev_title>PAMDA</abbrev_title>
    <issn media_type="electronic">2836-4449</issn>
   </journal_metadata>
   <journal_issue>
    <publication_date media_type="online">
     <year>2023</year>
    </publication_date>
    <journal_volume>
     <volume>2</volume>
    </journal_volume>
    <issue>2</issue>
   </journal_issue>
   <journal_article publication_type="full_text">
    <titles>
     <title>Neutrosophic Treatment of Duality Linear Models and the Binary Simplex Algorithm</title>
    </titles>
    <contributors>
     <person_name sequence="first" contributor_role="author">
      <given_name>Maissam</given_name>
      <surname>Jdid</surname>
      <affiliations>
       <institution>
        <institution_name>Faculty of Science, Damascus University, Damascus, Syria</institution_name>
       </institution>
      </affiliations>
     </person_name>
     <person_name sequence="additional" contributor_role="author">
      <given_name>Florentin</given_name>
      <surname>Smarandache</surname>
      <affiliations>
       <institution>
        <institution_name>University of New Mexico، Mathematics, Physics and Natural Sciences Division 705 Gurley Ave., Gallup, NM 87301, USA</institution_name>
       </institution>
      </affiliations>
     </person_name>
    </contributors>
    <jats:abstract>
     <jats:p>One of the most important theories in linear programming is the dualistic theory and its basic idea is that for every linear model has dual linear model, so that solving the original linear model gives a solution to the dual model. Therefore, when we solving the linear programming model, we actually obtain solutions for two linear models. In this research, we present a study of the models. The neutrosophic dual and the binary simplex algorithm, which works to find the optimal solution for the original and dual models at the same time. The importance of this algorithm is evident in that it is relied upon in several operations research topics, such as integer programming algorithms, some nonlinear programming algorithms, and sensitivity analysis in linear programming...</jats:p>
    </jats:abstract>
    <publication_date media_type="online">
     <year>2023</year>
    </publication_date>
    <pages>
     <first_page>08</first_page>
     <last_page>21</last_page>
    </pages>
    <publisher_item>
     <item_number item_number_type="article-number">2233</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/PAMDA.020202</doi>
     <resource>https://www.americaspg.com/journal/34/article/2233</resource>
     <collection property="text-mining">
      <item>
       <resource mime_type="application/pdf">https://www.americaspg.com/storage/21701036567.pdf</resource>
      </item>
     </collection>
    </doi_data>
   </journal_article>
  </journal>
 </body>
</doi_batch>
