-duality of nondifferentiable nonconvex multiobjective programming
From MaRDI portal
Publication:2277144
See the preview in Zbl 0702.90072.
Cites work
- A New Approach to Lagrange Multipliers
- Generalized Gradients and Applications
- scientific article; zbMATH DE number 3662118 (Why is no real title available?)
- Necessary conditions for ε-optimality
- On the variational principle
- Penalty functions in ε-programming and ε-minimax problems
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
Cited in
(58)- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- -duality theorem of nondifferentiable nonconvex multiobjective programming
- On several concepts for \(\varepsilon\)-efficiency
- On approximate solutions for robust convex semidefinite optimization problems
- Approximate quasi efficiency of set-valued optimization problems via weak subdifferential
- Coradiant-valued maps and approximate solutions in variable ordering structures
- -optimality and duality for multiobjective fractional programming
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space
- Optimality via generalized approximate convexity and quasiefficiency
- On -optimality conditions for multiobjective fractional optimization problems
- An approach to -duality theorems for nonconvex semi-infinite multiobjective optimization problems
- On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization
- Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization
- On approximate solutions and saddle point theorems for robust convex optimization
- A unified concept of approximate and quasi efficient solutions and associated subdifferentials in multiobjective optimization
- Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications
- Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization
- Optimality conditions for metrically consistent approximate solutions in vector optimization
- Generalized augmented Lagrangian problem and approximate optimal solutions in nonlinear programming
- Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
- Sequential optimality conditions for multiobjective fractional programming problems
- A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems
- Necessary optimality conditions and saddle points for approximate optimization in Banach space
- Approximate solutions of multiobjective optimization problems
- On -solutions for robust fractional optimization problems
- Optimality conditions for approximate quasi efficiency in set-valued equilibrium problems
- On -solutions for convex optimization problems with uncertainty data
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
- Characterizing -properly efficient solutions
- Two Types of Approximate Saddle Points
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
- A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions
- Refinements of -duality theorems for a nonconvex problem with an infinite number of constraints
- Characterizations of robust -quasi optimal solutions for nonsmooth optimization problems with uncertain data
- Approximate quasi solutions of multiobjective optimization problems
- Approximate optimality conditions and approximate duality conditions for robust multiobjective optimization problems
- Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
- Characterizations of approximate duality and saddle point theorems for nonsmooth robust vector optimization
- On approximate solutions for nonsmooth robust multiobjective optimization problems
- ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
- APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING
- -optimal solutions in nonconvex semi-infinite programs with support functions
- ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps
- \(\epsilon\)-duality theorem of nondifferentiable nonconvex multiobjective programming
- Further results on quasi efficient solutions in multiobjective optimization
- Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications
- Approximate solutions for robust multiobjective optimization programming in Asplund spaces
- Optimality conditions and duality analysis via generalized subdifferentials for \(\epsilon\)-quasi solutions of vector optimization problems
- Optimality and duality in nondifferentiable minimax programming problems involving \(\epsilon\)-quasi solutions
- Optimality analysis for \(\epsilon\)-quasi solutions of optimization problems via \(\epsilon\)-upper convexificators: a dual approach
- Approximate solutions for multi-objective optimization problems via scalarizing and nonscalarizing methods
- Nonlinear separation theorems for co-radiant sets and optimality conditions for approximate and proper approximate solutions in vector optimization
- Optimality and duality for approximate solutions of multiobjective optimization problems involving intersection of closed sets
- \(\mathcal{E}\)-\(LU\)-Pareto solutions for semi-infinite programs with multiple intervals
- On approximate efficiency in multiobjective programming
- \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints
- Generalized -quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
This page was built for publication: \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277144)
