Higher-order optimality conditions in multiobjective programming and uncertain optimization
In this paper, we study higher-order directional derivatives of order ℓ∈(1,+∞), allowing for non-integer values. We establish their existence and basic calculus rules, including unions, intersections, compositions, and sums. We introduce a directionally local higher-order error bound, which provides a constraint qualification under mild assumptions. Then, we employ them to derive the Karush–Kuhn–Tucker-type necessary conditions and sufficient conditions for weakly efficient and higher-order sharp efficient solutions. We also consider uncertain optimization problems. By reformulating the uncertain model into a suitable deterministic form, we obtain optimality conditions for robust solutions, showing that the approach remains applicable under data uncertainty. Examples are presented to illustrate the obtained results and the role of non-integer higher-order information.
Authors
- Nguyễn Minh Tùng
- Cuong M. Nguyen
Institutions
- Vietnam National University Ho Chi Minh City (VN)
- Ho Chi Minh University of Banking (VN)
- Ho Chi Minh City University of Technology (VN)
- Saigon University (VN)
Publication Details
- Journal
- Optimization
- Published
- 2026-11-20
- DOI
- https://doi.org/10.1080/02331934.2026.2763460
- Primary Topic
- Optimization and Variational Analysis
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Foundation for Science and Technology Development
- Ho Chi Minh City University of Technology and Education
- Vietnam Institute for Advanced Study in Mathematics
- Viet Nam National University Ho Chi Minh City