Minimax programming as a tool for studying robust multi-objective optimization problems
type: Item
instance of: scholarly article
title: Minimax programming as a tool for studying robust multi-objective optimization problems
zbMATH Open document ID: 1502.90125
author: Zhe Hong
author: Kwan Deok Bae
author: Do Sang Kim
published in: Annals of Operations Research
publication date: 2022-12-20T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 7634700
zbMATH Keywords: multi-objective optimization
zbMATH Keywords: minimax programming
zbMATH Keywords: generalized convexity
zbMATH Keywords: KKT optimality conditions
zbMATH Keywords: duality
MaRDI profile type: Publication
full work available at URL: s10479-021-04179-w
OpenAlex ID: W3182145356
cites work: The Lagrange Multiplier Theorem for Max-Min with Several Constraints
cites work: Duality for a class of minmax and inexact programming problem
cites work: Robust Truss Topology Design via Semidefinite Programming
cites work: Robust convex optimization
cites work: Selected topics in robust convex optimization
cites work: Q3182207
cites work: Duality in robust optimization: Primal worst equals dual best
cites work: Deriving robust counterparts of nonlinear uncertain inequalities
cites work: Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
cites work: Optimality and duality for robust multiobjective optimization problems
cites work: Optimality conditions and duality in nonsmooth multiobjective optimization problems
cites work: A class of nonsmooth fractional multiobjective optimization problems
cites work: Nondifferentiable minimax programming problems with applications
cites work: Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications
cites work: Optimization and nonsmooth analysis
cites work: Multicriteria Optimization
cites work: Minmax robustness for multi-objective optimization problems
cites work: Robust Solutions to Least-Squares Problems with Uncertain Data
cites work: Robust Solutions to Uncertain Semidefinite Programs
cites work: Technical Note—Exact Solutions of Inexact Linear Programs
cites work: Optimality conditions in convex optimization with locally Lipschitz constraints
cites work: Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
cites work: On the existence of Pareto solutions for polynomial vector optimization problems
cites work: Robust discrete optimization and its applications
cites work: Nondifferentiable minimax fractional programming in complex spaces with parametric duality
cites work: Variational Analysis and Applications
cites work: \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
cites work: Convex programming with set-inclusive contraints and its applications to generalized linear and fractional programming
cites work: Nondifferentiable mathematical programming and convex-concave functions
DOI: 10.1007/S10479-021-04179-W
description: scientific article; zbMATH DE number 7634700