Abstract
In the paper, the classical exact absolute value function method is used for solving a nondifferentiable constrained interval-valued optimization problem with both inequality and equality constraints. The property of exactness of the penalization for the exact absolute value penalty function method is analyzed under assumption that the functions constituting the considered nondifferentiable constrained optimization problem with the interval-valued objective function are convex. The conditions guaranteeing the equivalence of the sets of LU-optimal solutions for the original constrained interval-valued extremum problem and for its associated penalized optimization problem with the interval-valued exact absolute value penalty function are given.
Highlights
In optimization theory, the coefficients of the extremum problems are usually considered as deterministic values and, the corresponding solutions are precise
The results established in the paper are illustrated by suitable examples of optimization problems with the interval-valued objective function solved by using the exact l1 penalty function method
An associated penalized optimization problem with the interval-valued exact l1 penalty function is constructed for the considered intervalvalued minimization problem
Summary
The coefficients of the extremum problems are usually considered as deterministic values and, the corresponding solutions are precise. We first prove that a Karush-Kuhn-Tucker point of the considered nondifferentiable interval-valued constrained optimization problem is a LU-minimizer of its associated penalized optimization problem with the interval-valued exact l1 penalty function. This result is established under convexity hypotheses for all penalty parameters c exceeding the threshold value, which is expressed as the function of Lagrange multipliers. The results established in the paper are illustrated by suitable examples of optimization problems with the interval-valued objective function solved by using the exact l1 penalty function method. We extend and improve the results established by Jayswal and Banerjee [37] for the exact l1 penalty function method, who used it for solving differentiable interval-valued optimization problems with inequality constraints only
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
