Optimality conditions for multiobjective fractional programming, via convexificators
From MaRDI portal
(Redirected from Publication:781069)
Recommendations
- Optimality conditions for multi-objective fractional programming with a new formulation of generalized convexity
- Optimality conditions for multiobjective fractional variational problems
- Multiobjective fractional programming with generalized convexity
- Necessary and sufficient optimality conditions for fractional multi-objective problems
- The \(\varepsilon\)-optimality conditions for multiobjective fractional programming problems
- Optimality conditions and duality in multiobjective generalized fractional programming with generalized convexity
- Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity
- Optimality Conditions and Duality for Nondifferentiable Multiobjective Fractional Programming Problems
- Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem
- Optimality conditions and duality in nonsmooth multiobjective fractional programming
Cites work
- scientific article; zbMATH DE number 3850851 (Why is no real title available?)
- scientific article; zbMATH DE number 823381 (Why is no real title available?)
- scientific article; zbMATH DE number 872150 (Why is no real title available?)
- A generalized derivative for calm and stable functions
- An approach to controlled mechanical systems based on the multiobjective optimization technique
- Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C1-Optimization
- Componentwise versus global approaches to nonsmooth multiobjective optimization
- Convexifactors, generalized convexity and vector optimization
- Convexificators and necessary conditions for efficiency
- Convexificators and strong Kuhn-Tucker conditions
- Efficiency conditions and duality for a class of multiobjective fractional programming problems
- Hunting for a smaller convex subdifferential
- Necessary and sufficient optimality conditions for fractional multi-objective problems
- Nonlinear Programming
- Nonlinear augmented Lagrangian for nonconvex multiobjective optimization
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Optimality and duality for nonsmooth multiobjective fractional programming with mixed constraints
- Optimality conditions, duality and saddle points for nondifferentiable multiobjective fractional programs
- Optimization and nonsmooth analysis
- Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
- The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
- Variational Analysis
Cited in
(24)- scientific article; zbMATH DE number 7332468 (Why is no real title available?)
- Sequential approximate optimality conditions for multi objective fractional programming problems via sequential approximate subdifferential calculus
- Optimality conditions and duality in subdifferentiable multiobjective fractional programming
- On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems
- Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions
- scientific article; zbMATH DE number 5927033 (Why is no real title available?)
- Convexificators and necessary conditions for efficiency
- Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem
- Optimality and duality for weak quasi efficiency of multiobjective fractional problems via convexificators
- scientific article; zbMATH DE number 5917225 (Why is no real title available?)
- Optimality Conditions and Saddle Point Criteria for Fractional Interval-valued Optimization Problem via Convexificator
- The Karush–Kuhn–Tucker conditions for multiple objective fractional interval valued optimization problems
- On approximate strong KKT points of nonsmooth interval-valued mutiobjective optimization problems using convexificators
- Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints
- Multiobjective problems: enhanced necessary conditions and new constraint qualifications through convexificators
- Sequential optimality conditions of approximate proper efficiency for a multiobjective fractional programming problem
- A study on vector variational-like inequalities using convexificators and application to its bi-level form
- Necessary optimality conditions for a set valued fractional programming problem in terms of contingent epiderivatives
- Optimality conditions for multiple objective fractional subset programming with \((\rho,\sigma,\theta )\)-type-I and related non-convex functions
- Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem
- Necessary and sufficient conditions for efficiency via convexificators
- Constraint qualifications and optimality conditions for nonsmooth multiobjective mathematical programming problems with vanishing constraints on Hadamard manifolds via convexificators
- Necessary optimality conditions for a fractional multiobjective optimization problem
- scientific article; zbMATH DE number 7547172 (Why is no real title available?)
This page was built for publication: Optimality conditions for multiobjective fractional programming, via convexificators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q781069)
