4.6 Article

Convexificators for nonconvex multiobjective optimization problems with uncertain data: robust optimality and duality

Related references

Note: Only part of the references are listed.
Article Operations Research & Management Science

Multiobjective optimization with least constraint violation: optimality conditions and exact penalization

Jiawei Chen et al.

Summary: In this paper, the authors reformulate the multiobjective optimization problem with possible inconsistent constraints into a problem with least constraint violation. They provide necessary optimality conditions from different stationary point perspectives and propose a power penalty problem using infeasibility measure of constraints. The authors introduce calmness conditions and local exact penalization, and establish equivalences and necessary and sufficient conditions for these properties.

JOURNAL OF GLOBAL OPTIMIZATION (2023)

Article Operations Research & Management Science

Characterizing a Class of Robust Vector Polynomial Optimization via Sum of Squares Conditions

Xiangkai Sun et al.

Summary: This paper addresses the SOS-convex polynomial optimization problem under spectrahedral uncertain data. By using a robust-type characteristic cone constraint qualification, necessary and sufficient conditions for robust weakly efficient solutions are derived through sum of squares conditions and linear matrix inequalities. A relaxation dual problem is proposed and the weak and strong duality properties are explored. Additionally, a numerical example demonstrates that the relaxation dual problem can be reformulated as a semidefinite linear programming problem.

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2023)

Article Operations Research & Management Science

Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data

Xiangkai Sun et al.

Summary: This paper investigates uncertain multiobjective fractional semi-infinite optimization problems, obtaining necessary and sufficient optimality conditions, introducing a mixed type approximate dual problem, and deriving robust approximate weak saddle point theorems related to such problems.

OPTIMIZATION LETTERS (2022)

Article Mathematics, Applied

New results on proper efficiency for a class of vector optimization problems

N. T. T. Huong et al.

Summary: This paper introduces two new theorems on Geoffrion's properly efficient solutions and provides seven examples demonstrating their applications in linear fractional vector optimization problems with unbounded constraint sets. The first theorem gives sufficient conditions for the efficient solution set to coincide with Geoffrion's properly efficient solution set when all components of the objective function are properly fractional. The second theorem establishes sufficient conditions for an efficient solution to be a Geoffrion's properly efficient solution, even when the objective function includes some affine components.

APPLICABLE ANALYSIS (2021)

Article Operations Research & Management Science

Characterizations of robust ε-quasi optimal solutions for nonsmooth optimization problems with uncertain data

Xiang-Kai Sun et al.

Summary: This paper discusses robust epsilon-quasi optimal solutions for nonsmooth optimization problems with uncertain data, establishing approximate optimality conditions and exploring relationships through robust optimization and a mixed-type robust approximate dual problem. Optimal conditions for robust weakly approximate efficient solutions for an uncertain nonsmooth multiobjective optimization problem are derived using a scalarization method, along with approximate duality theorems for the problem.

OPTIMIZATION (2021)

Article Mathematics, Applied

Second-order optimality conditions for efficiency in C1,1-smooth quasiconvex multiobjective programming problem

Tran Van Su et al.

Summary: This paper explores a quasiconvex multiobjective programming problem and introduces generalized constraint qualifications, as well as strong and weak second-order necessary optimality conditions, providing further sufficient optimality conditions near feasible solutions.

COMPUTATIONAL & APPLIED MATHEMATICS (2021)

Article Operations Research & Management Science

Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem

S. Dempe et al.

OPTIMIZATION (2020)

Article Operations Research & Management Science

Characterizations of Multiobjective Robustness via Oriented Distance Function and Image Space Analysis

Qamrul Hasan Ansari et al.

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2019)

Article Operations Research & Management Science

Optimality Conditions and Duality for Robust Nonsmooth Multiobjective Optimization Problems with Constraints

Jiawei Chen et al.

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2019)

Article Operations Research & Management Science

Separations and Optimality of Constrained Multiobjective Optimization via Improvement Sets

Jiawei Chen et al.

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2018)

Article Management

A unified approach to uncertain optimization

Kathrin Klamroth et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2017)

Article Management

Necessary and sufficient conditions for Pareto efficiency in robust multiobjective optimization

Rasmus Bokrantz et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2017)

Article Mathematics, Applied

Optimality and duality for robust multiobjective optimization problems

Thai Doan Chuong

NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS (2016)

Article Mathematics

Optimality conditions and duality for interval-valued optimization problems using convexifactors

Anurag Jayswal et al.

RENDICONTI DEL CIRCOLO MATEMATICO DI PALERMO (2016)

Article Management

Robust solutions to multi-objective linear programs with uncertain data

M. A. Goberna et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2015)

Article Operations Research & Management Science

Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty

V. Jeyakumar et al.

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2015)

Article Operations Research & Management Science

Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations

Jonas Ide et al.

MATHEMATICAL METHODS OF OPERATIONS RESEARCH (2014)

Article Mathematics, Applied

STRONG DUALITY IN ROBUST CONVEX PROGRAMMING: COMPLETE CHARACTERIZATIONS

V. Jeyakumar et al.

SIAM JOURNAL ON OPTIMIZATION (2010)

Article Operations Research & Management Science

Duality in robust optimization: Primal worst equals dual best

Amir Beck et al.

OPERATIONS RESEARCH LETTERS (2009)

Article Computer Science, Software Engineering

Selected topics in robust convex optimization

Aharon Ben-Tal et al.

MATHEMATICAL PROGRAMMING (2008)

Article Operations Research & Management Science

Necessary optimality conditions in terms of convexificators in Lipschitz optimization

X. F. Li et al.

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2006)

Article Operations Research & Management Science

Convexifactors, generalized convexity and vector optimization

J Dutta et al.

OPTIMIZATION (2004)

Article Computer Science, Software Engineering

Robust optimization - methodology and applications

A Ben-Tal et al.

MATHEMATICAL PROGRAMMING (2002)

Article Operations Research & Management Science

Convexifactors, generalized convexity, and optimality conditions

J Dutta et al.

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2002)