Table of Contents
Fetching ...

On approximate Pareto solutions in nonsmooth interval-valued multiobjective optimization with data uncertainty in constraints

Vu Hong Quan, Duong Thi Viet An, Nguyen Van Tuyen

TL;DR

This paper addresses robust, nonsmooth, interval-valued multiobjective optimization with data uncertainty in constraints by introducing $\mathcal{E}$-approximate Pareto notions under the $LU$ interval order. It combines Ekeland's variational principle and subdifferential calculus to derive KKT-type necessary conditions for almost $\mathcal{E}$-Pareto and almost $\mathcal{E}$-quasi Pareto solutions, and constructs a penalized scalar problem to ensure existence. Under generalized convexity, it develops Wolfe-type $\mathcal{E}$-duality and a dual multiobjective problem based on an $\mathcal{E}$-interval-valued Lagrangian, establishing both $\mathcal{E}$-duality and converse-like duality results. The work further introduces quasi-$\mathcal{E}$ Pareto saddle points and demonstrates their relation to primal solutions, providing a cohesive framework for analysis of robust interval-valued MOPs with uncertainty in the constraints.

Abstract

This paper deals with approximate Pareto solutions of a nonsmooth interval-valued multiobjective optimization problem with data uncertainty in constraints. We first introduce some kinds of approximate Pareto solutions for the robust counterpart (RMP) of the problem in question by considering the lower-upper interval order relation including: (almost, almost regular) $\mathcal{E}$-Pareto solution and (almost, almost regular) $\mathcal{E}$-quasi Pareto solution. By using a scalar penalty function, we obtain a result on the existence of an almost regular $\mathcal{E}$-Pareto solution of (RMP) that satisfies the Karush--Kuhn--Tucker necessary optimality condition up to a given precision. We then establish sufficient conditions and Wolfe-type $\mathcal{E}$-duality relations for approximate Pareto solutions of (RMP) under the assumption of generalized convexity. In addition, we present a dual multiobjective problem to the primal one via the $\mathcal{E}$-interval-valued vector Lagrangian function and examine duality relations.

On approximate Pareto solutions in nonsmooth interval-valued multiobjective optimization with data uncertainty in constraints

TL;DR

This paper addresses robust, nonsmooth, interval-valued multiobjective optimization with data uncertainty in constraints by introducing -approximate Pareto notions under the interval order. It combines Ekeland's variational principle and subdifferential calculus to derive KKT-type necessary conditions for almost -Pareto and almost -quasi Pareto solutions, and constructs a penalized scalar problem to ensure existence. Under generalized convexity, it develops Wolfe-type -duality and a dual multiobjective problem based on an -interval-valued Lagrangian, establishing both -duality and converse-like duality results. The work further introduces quasi- Pareto saddle points and demonstrates their relation to primal solutions, providing a cohesive framework for analysis of robust interval-valued MOPs with uncertainty in the constraints.

Abstract

This paper deals with approximate Pareto solutions of a nonsmooth interval-valued multiobjective optimization problem with data uncertainty in constraints. We first introduce some kinds of approximate Pareto solutions for the robust counterpart (RMP) of the problem in question by considering the lower-upper interval order relation including: (almost, almost regular) -Pareto solution and (almost, almost regular) -quasi Pareto solution. By using a scalar penalty function, we obtain a result on the existence of an almost regular -Pareto solution of (RMP) that satisfies the Karush--Kuhn--Tucker necessary optimality condition up to a given precision. We then establish sufficient conditions and Wolfe-type -duality relations for approximate Pareto solutions of (RMP) under the assumption of generalized convexity. In addition, we present a dual multiobjective problem to the primal one via the -interval-valued vector Lagrangian function and examine duality relations.

Paper Structure

This paper contains 6 sections, 13 theorems, 115 equations.

Key Result

Proposition 2.1

Let $\varphi\colon\mathbb{R}^n\to\overline{\mathbb{R}}$ be finite at $\bar{x}$. If $\bar{x}$ is a local minimizer of $\varphi$, then $0\in\partial\varphi(\bar{x}).$

Theorems & Definitions (39)

  • Definition 2.1: see mor06
  • Definition 2.2: see mor06
  • Proposition 2.1: see mor06
  • Proposition 2.2
  • Proposition 2.3: see mor06
  • Definition 2.3: see Kulisch-81Ishibuchi-Tanaka-90Wu-07
  • Definition 3.1
  • Definition 3.2
  • Example 3.1
  • Definition 3.3
  • ...and 29 more