Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials

DOI10.3934/jimo.2022224OpenAlexW4312697805MaRDI QIDQ2698576

Juan Liu, Nan-Jing Huang, Xian-Jun Long

Publication date: 24 April 2023

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2022224

zbMATH Keywords

approximate optimality conditiontangential subdifferentialmixed type dualsemi-infinite multiobjective programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)

Related Items (1)

Approximate optimal solutions for multiobjective optimization problems with infinite constraints

Cites Work

• \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
• A new approach to characterize the solution set of a pseudoconvex programming problem
• Nonsmooth semi-infinite programming problem using limiting subdifferentials
• Semi-infinite optimization under convex function perturbations: Lipschitz stability
• On the stability of solutions for semi-infinite vector optimization problems
• Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
• Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
• Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications
• Saddle point criteria in nonsmooth semi-infinite minimax fractional programming problems
• Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
• On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints
• On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
• Mixed type duality in multiobjective programming problems
• Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
• Characterizing the solution set of convex optimization problems without convexity of constraints
• On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming
• Nonsmooth semi-infinite multiobjective optimization problems
• How to solve a semi-infinite optimization problem
• Optimality conditions and duality for nondifferentiable multiobjective semi-infinite programming problems with generalized \((C,\alpha,\rho,d)\)-convexity
• Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
• Some characterizations of approximate solutions for robust semi-infinite optimization problems
• OPTIMALITY CONDITIONS AND DUALITY FOR SEMI-INFINITE PROGRAMMING INVOLVING SEMILOCALLY TYPE I-PREINVEX AND RELATED FUNCTIONS
• Constraint Qualifications in Semi-Infinite Systems and Their Applications in Nonsmooth Semi-Infinite Problems with Mixed Constraints
• Subdifferentials of Marginal Functions in Semi-infinite Programming
• Strong Karush–Kuhn–Tucker optimality conditions for multiobjective semi-infinite programming via tangential subdifferential
• On constraint qualifications in directionally differentiable multiobjective optimization problems
• Calmness Modulus of Linear Semi-infinite Programs
• Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials
• Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
• Karush-Kuhn-Tucker Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming Via Tangential Subdifferentials
• Optimality Conditions and Duality for Semi-Infinite Mathematical Programming Problem with Equilibrium Constraints
• Subdifferentials of Nonconvex Supremum Functions and Their Applications to Semi-infinite and Infinite Programs with Lipschitzian Data
• Quasi-Slater and Farkas--Minkowski Qualifications for Semi-infinite Programming with Applications
• New Farkas-type constraint qualifications in convex infinite programming
• Dini derivatives in optimization — Part I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials