On a Weighting Technique for Multiple Cost Optimization Problems with Interval Values
Abstract
:1. Introduction
2. Preliminary Results
- (i)
- ;
- (ii)
- ;
- (iii)
- ;
- (iv)
- and ,where is an index set. We consider K as a compact set in with two arbitrary fixed points, and Z is a family of piecewise smooth functions (state variable), and is the family of all piecewise continuous functions (control variables). Furthermore, consider and as vector-valued functionals that possess continuous differentiability concerning each of their inputs. The functional is defined for an independent variable , with as an n-dimensional piecewise smooth function of ( denoting the partial derivative of with respect to ), and is a s-dimensional piecewise continuous function of . To make the notation less complex, we will denote and as and , respectively. If are the components of the above-mentioned vector-valued function X, the partial derivatives of with respect to , and are denoted as , and , respectively. More precisely, and are defined as the vectors and , respectively. Similarly, the first-order partial derivatives and of the vector-valued functionals Y and H, respectively, can be expressed using matrices with rows instead of a single row.
- (a)
- and ;
- (b)
- ;
- (c)
- and ;
- (d)
- , where is a real number;
- (e)
- where is a real number.
3. Main Results
4. Discussion of Technical and Distinguished Issues
5. Conclusions and Future Research Directions
Author Contributions
Funding
Data Availability Statement
Acknowledgments
Conflicts of Interest
References
- Salehnia, T.; MiarNaeimi, F.; Izadi, S.; Ahmadi, M.; Montazerolghaem, A.; Mirjalili, S.; Abualigah, L. A MTIS method using a combined of whale and moth-flame optimization algorithms. In Handbook of Whale Optimization Algorithm; Academic Press: New York, NY, USA, 2024; pp. 625–651. [Google Scholar]
- Moore, R.E. Interval Analysis; Prentice-Hall: Englewood Cliffs, NJ, USA, 1966. [Google Scholar]
- Moore, R.E. Methods and Applications of Interval Analysis; SIAM: Philadelphia, PA, USA, 1979. [Google Scholar]
- Moore, R.E.; Kearfott, R.B.; Cloud, M.J. Introduction to Interval Analysis; SIAM: Philadelphia, PA, USA, 2009. [Google Scholar]
- Charnes, A.; Granot, F.; Phillips, F. An algorithm for solving interval linear programming problems. Oper. Res. 1977, 25, 688–695. [Google Scholar] [CrossRef]
- Alefeld, G.; Herzberger, J. Introduction to Interval Computations; Academic Press: New York, NY, USA, 1983. [Google Scholar]
- Giannessi, F. Theorems of the alternative and optimality conditions. J. Optim. Theory Appl. 1984, 42, 331–365. [Google Scholar] [CrossRef]
- Ishibuchi, H.; Tanaka, H. Multiobjective programming in optimization of the interval objective function. Eur. J. Oper. Res. 1990, 48, 219–225. [Google Scholar] [CrossRef]
- Pereira, F.L. Control design for autonomous vehicles: A dynamic optimization perspective. Eur. J. Control 2001, 7, 178–202. [Google Scholar] [CrossRef]
- Jana, M.; Panda, G. Solution of nonlinear interval vector optimization problem. Oper. Res. 2014, 14, 71–85. [Google Scholar]
- Ahmad, I.; Singh, D.; Dar, B.A. Optimality conditions in multiobjective programming problems with interval-valued objective functions. Control. Cybern. 2015, 44, 19–45. [Google Scholar]
- Ahmad, I.; Jayswal, A.; Al-Homidan, S.; Banerjee, J. Sufficiency and duality in interval-valued variational programming. Neural Comput. Appl. 2019, 31, 4423–4433. [Google Scholar] [CrossRef]
- Debnath, I.P.; Pokharna, N. On optimality and duality in interval-valued variational problem with B-(p,r)-invexity. RAIRO—Oper. Res. 2021, 55, 1909–1932. [Google Scholar] [CrossRef]
- Wu, H.C. Solving the interval-valued optimization problems based on the concept of null set. J. Ind. Manag. Optim. 2018, 14, 1157–1178. [Google Scholar] [CrossRef]
- Jha, S.; Das, P.; Bandhyopadhyay, S. Characterization of LU-efficiency and saddle-point criteria for F-approximated multiobjective interval-valued variational problems. Results Control Optim. 2021, 4, 100044. [Google Scholar] [CrossRef]
- Guo, Y.; Ye, G.; Liu, W.; Zhao, D.; Treanţă, S. Solving nonsmooth interval optimization problems based on interval-valued symmetric invexity. Chaos, Solitons Fractals 2023, 174, 113834. [Google Scholar] [CrossRef]
- Rani, B.J.; Kummari, K. Duality for fractional interval-valued optimization problem via convexificator. Opsearch 2023, 60, 481–500. [Google Scholar] [CrossRef]
- Treanţă, S.; Ciontescu, M. On optimal control problems with generalized invariant convex interval-valued functionals. J. Indust. Manag. Optim. 2024, 20, 3317–3336. [Google Scholar] [CrossRef]
- Ye, J.J. Necessary and sufficient optimality conditions for mathematical program with equilibrium constraints. J. Math. Anal. Appl. 2005, 307, 350–369. [Google Scholar] [CrossRef]
- Joshi, B.C. Optimality and duality for nonsmooth semi-infinite mathematical program with equilibrium constraints involving generalized invexity of order σ>0. RAIRO Oper. Res. 2021, 55, 2221–2240. [Google Scholar] [CrossRef]
- Su, T.V. Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints. J. Glob. Optim. 2023, 85, 663–685. [Google Scholar] [CrossRef]
- Wu, H.C. The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions. Eur. J. Oper. Res. 2009, 196, 49–60. [Google Scholar] [CrossRef]
- Treanţă, S. On a class of interval-valued optimization problems. Contin. Mech. Thermodyn. 2022, 34, 617–626. [Google Scholar] [CrossRef]
- Treanţă, S. Characterization results of solutions in interval-valued optimization problems with mixed constraints. J. Glob. Optim. 2022, 82, 951–964. [Google Scholar] [CrossRef]
- Giorgi, G. Again on the Farkas Theorem and the Tucker Key Theorem Proved Easily; DEM Working Paper Series; University of Pavia, Department of Economics and Management: Pavia, Italy, 2014; Volume 94. [Google Scholar]
- Antczak, T. Weighting method for convex vector interval-valued optimization problems. Sci. Bull. Ser. A Appl. Math. Phys. 2022, 84, 155–162. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
Share and Cite
Treanţă, S.; Alsalami, O.M. On a Weighting Technique for Multiple Cost Optimization Problems with Interval Values. Mathematics 2024, 12, 2321. https://doi.org/10.3390/math12152321
Treanţă S, Alsalami OM. On a Weighting Technique for Multiple Cost Optimization Problems with Interval Values. Mathematics. 2024; 12(15):2321. https://doi.org/10.3390/math12152321
Chicago/Turabian StyleTreanţă, Savin, and Omar Mutab Alsalami. 2024. "On a Weighting Technique for Multiple Cost Optimization Problems with Interval Values" Mathematics 12, no. 15: 2321. https://doi.org/10.3390/math12152321
APA StyleTreanţă, S., & Alsalami, O. M. (2024). On a Weighting Technique for Multiple Cost Optimization Problems with Interval Values. Mathematics, 12(15), 2321. https://doi.org/10.3390/math12152321