<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="nlm-ta">REA Press</journal-id>
      <journal-id journal-id-type="publisher-id">Null</journal-id>
      <journal-title>REA Press</journal-title><issn pub-type="ppub">3042-0199</issn><issn pub-type="epub">3042-0199</issn><publisher>
      	<publisher-name>REA Press</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">https://doi.org/10.22105/opt.v2i2.81</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group><subject>Fuzzy number, Optimization problem, IFQNDFP optimization technique, Inexact line search, Armijo line search</subject></subj-group>
      </article-categories>
      <title-group>
        <article-title>An Inexact Line Search FQNDFP Algorithm to Investigate UncertainOptimization Problems</article-title><subtitle>An Inexact Line Search FQNDFP Algorithm to Investigate UncertainOptimization Problems</subtitle></title-group>
      <contrib-group><contrib contrib-type="author">
	<name name-style="western">
	<surname>Panigrahi </surname>
		<given-names>Paresh Kumar </given-names>
	</name>
	<aff>1Department of Mathematics Vignan’s Institute of Information Technology (A),Duvvada, Vishakhapatnam, AP 530049, India.</aff>
	</contrib><contrib contrib-type="author">
	<name name-style="western">
	<surname>Nayak</surname>
		<given-names>Sukanta </given-names>
	</name>
	<aff>Sukanta </aff>
	</contrib></contrib-group>		
      <pub-date pub-type="ppub">
        <month>04</month>
        <year>2025</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>29</day>
        <month>04</month>
        <year>2025</year>
      </pub-date>
      <volume>2</volume>
      <issue>2</issue>
      <permissions>
        <copyright-statement>© 2025 REA Press</copyright-statement>
        <copyright-year>2025</copyright-year>
        <license license-type="open-access" xlink:href="http://creativecommons.org/licenses/by/2.5/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</p></license>
      </permissions>
      <related-article related-article-type="companion" vol="2" page="e235" id="RA1" ext-link-type="pmc">
			<article-title>An Inexact Line Search FQNDFP Algorithm to Investigate UncertainOptimization Problems</article-title>
      </related-article>
	  <abstract abstract-type="toc">
		<p>
			This paper introduces a Fuzzy Quasi Newton Davidon Fletcher Powell (FQNDFP) optimization algorithm incorporating with Armijo line search technique to effectively handle imprecisely defined optimization problems. Unlike traditional probabilistic methods, this approach leverages fuzzy set theory to model uncertainties in optimization variables given in the objective function. The proposed algorithm integrates the Davidon Fletcher-Powell (DFP) update formula, ensuring computational efficiency and rapid convergence by approximating the inverse Hessian matrix. The Armijo line search guarantees sufficient descent while adapting the step size dynamically. This combination enhances the algorithm’s ability to navigate complex, nonlinear, and uncertain objective landscapes effectively. The performance of the algorithm is evaluated on benchmark problems and fuzzy objective functions, demonstrating accuracy, robustness, and convergence compared to existing methods.
		</p>
		</abstract>
    </article-meta>
  </front>
  <body></body>
  <back>
    <ack>
      <p>Null</p>
    </ack>
  </back>
</article>