Multiobjective optimization problems with modified objective functions and cone constraints and applications
From MaRDI portal
Publication:620528
DOI10.1007/S10898-010-9539-3zbMATH Open1230.90166OpenAlexW2028435933MaRDI QIDQ620528FDOQ620528
Authors: Yeol Je Cho, J. K. Kim, Jiawei Chen, Jun Li 
Publication date: 19 January 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9539-3
Recommendations
- A new approach to multiobjective programming with a modified objective function
- MULTIOBJECTIVE FRACTIONAL PROGRAMMING WITH A MODIFIED OBJECTIVE FUNCTION
- Necessary and sufficient KKT optimality conditions in non-convex multi-objective optimization problems with cone constraints
- scientific article; zbMATH DE number 6129549
- Equivalence and existence of weak Pareto optima for multiobjective optimization problems with cone constraints
weakly efficient solutionLagrange functionmultiobjective optimization problem\(Q\)-(pseudo)invex\(Q\)-convexlikeKKT conditionsaddlepointweak (strong, converse) duality
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Variational and other types of inequalities involving nonlinear operators (general) (47J20)
Cites Work
- Title not available (Why is that?)
- On sufficiency of the Kuhn-Tucker conditions
- Vector variational inequalities and vector equilibria. Mathematical theories
- Equivalence and existence of weak Pareto optima for multiobjective optimization problems with cone constraints
- Optimality and duality in nondifferentiable and multiobjective programming under generalized \(d\)-invexity
- A class of nonconvex functions and mathematical programming
- An \(\eta\)-approximation method in nonlinear vector optimization
- Title not available (Why is that?)
- An Existence Theorem in Vector Optimization
- Generalized invexity and duality in multiobjective programming problems
- On ratio invexity in mathematical programming
- Modified ratio objective approach in mathematical programming
- Multiobjective duality with invexity
- A new approach to multiobjective programming with a modified objective function
- On duality for weakly minimized vector valued optimization problems
- Title not available (Why is that?)
- An η-Approximation Approach for Nonlinear Mathematical Programming Problems Involving Invex Functions
- An \(\eta\)-approximation approach to duality in mathematical programming problems involving \(r\)-invex functions
Cited In (30)
- Optimality conditions for pessimistic semivectorial bilevel programming problems
- Nonsmooth multiobjective optimization problems and weak vector quasi-variational inequalities
- Optimality Conditions for Multiobjective Optimization Problems via Image Space Analysis
- Convergence of iterative sequences for fixed points of an infinite family of nonexpansive mappings based on a hybrid steepest descent method
- Fixed point theorems on ordered gauge spaces with applications to nonlinear integral equations
- Cone contraction method with visual interaction for multiple‐objective non‐linear programmes
- A modified objective function method for solving nonlinear multiobjective fractional programming problems
- Optimality and duality in nonsmooth conic vector optimization
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems
- The characterization of efficiency and saddle point criteria for multiobjective optimization problem with vanishing constraints
- Second order modified objective function method for twice differentiable vector optimization problems over cone constraints
- Modified objective function method in nonsmooth vector optimization over cones
- One fixed point theorem for mixed monotone operators and applications to nonlinear integral equations
- On fractional vector optimization over cones with support functions
- Relationships between constrained and unconstrained multi-objective optimization and application in location theory
- Stability of approximating solutions to parametric bilevel vector equilibrium problems and applications
- Approximation of fixed points of weak Bregman relatively nonexpansive mappings in Banach spaces
- Continuity of the solution mapping to parametric generalized vector equilibrium problems
- Vector-valued separation functions and constrained vector optimization problems: optimality and saddle points
- Solving bilevel multiobjective programming problem by elite quantum behaved particle swarm optimization
- Vector critical points and cone efficiency in nonsmooth vector optimization
- A new approach to multiobjective programming with a modified objective function
- Title not available (Why is that?)
- A smoothing Newton method for mathematical programs governed by second-order cone constrained generalized equations
- Existence of solutions and convergence analysis for a system of quasivariational inclusions in Banach spaces
- Nonemptiness and compactness of solutions set for nondifferentiable multiobjective optimization problems
- Separations and optimality of constrained multiobjective optimization via improvement sets
- Existence and uniqueness of solution for quasi-equilibrium problems and fixed point problems on complete metric spaces with applications
- A linearized approach for solving differentiable vector optimization problems with vanishing constraints
This page was built for publication: Multiobjective optimization problems with modified objective functions and cone constraints and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q620528)
