An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems
type: Item
instance of: scholarly article
title: An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems
zbMATH Open document ID: 1401.90171
author: Do Sang Kim
author: T. Q. Son
published in: Taiwanese Journal of Mathematics
publication date: 2018-10-25T00:00:00Z
full work available at URL: https://projecteuclid.org/euclid.twjm/1531382431
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 49N15
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 6965418
zbMATH Keywords: generalized KKT condition up to \(\epsilon\)
zbMATH Keywords: almost quasi \(\epsilon\)-Pareto solution
zbMATH Keywords: almost quasi weakly \(\epsilon\)-Pareto solution
zbMATH Keywords: Wolfe duality
MaRDI profile type: Publication
OpenAlex ID: W2847167045
cites work: Q3603266
cites work: Duality in Vector Optimization
cites work: Planar point-objecitve location problems with nonconvex constraints: A geometrical construction
cites work: Regularity Conditions and Optimality in Vector Optimization
cites work: Q3760254
cites work: Nondifferentiable fractional semi-infinite multiobjective optimization problems
cites work: Nonsmooth semi-infinite multiobjective optimization problems
cites work: Approximate solutions of multiobjective optimization problems
cites work: Optimization and nonsmooth analysis
cites work: Q4375488
cites work: Necessary optimality conditions and saddle points for approximate optimization in Banach space
cites work: Multicriteria Optimization
cites work: Adaptive Scalarization Methods in Multiobjective Optimization
cites work: Exact generation of epsilon-efficient solutions in multiple objective programming
cites work: Cone characterizations of approximate solutions in real vector optimization
cites work: Q4830008
cites work: Q4357206
cites work: \(\varepsilon\)-optimality for multiobjective programming on a Banach space
cites work: Q5694959
cites work: On approximate solutions in vector optimization problems via scalarization
cites work: Optimality conditions for metrically consistent approximate solutions in vector optimization
cites work: An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗
cites work: Q3923954
cites work: Scalarization in vector optimization
cites work: Vector Optimization
cites work: On the representation of the search region in multi-objective optimization
cites work: Constrained optimization using multiple objective programming
cites work: Constructing a perfect duality in infinite programming
cites work: Constraint qualifications in nonsmooth multiobjective optimization
cites work: \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
cites work: Necessary conditions for ε-optimality
cites work: \(\epsilon\)-solutions in vector minimization problems
cites work: Scalarization of vector optimization problems
cites work: Survey of multi-objective optimization methods for engineering
cites work: Experiments with classification-based scalarizing functions in interactive multiobjective optimization
cites work: Optimality conditions in nonconvex semi-infinite multiobjective optimization problems
cites work: Augmented lagrangians in semi-infinite programming
cites work: \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
cites work: A new approach to characterize the solution set of a pseudoconvex programming problem
cites work: Weak stability and strong duality of a class of nonconvex infinite programs via augmented Lagrangian
cites work: \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
DOI: 10.11650/TJM/180603
description: scientific article; zbMATH DE number 6965418