Pages that link to "Item:Q781069"
From MaRDI portal
The following pages link to Optimality conditions for multiobjective fractional programming, via convexificators (Q781069):
Displaying 18 items.
- Optimality conditions for multiple objective fractional subset programming with \((\rho,\sigma,\theta )\)-type-I and related non-convex functions (Q695624) (← links)
- Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions (Q831364) (← links)
- Optimality conditions and duality in subdifferentiable multiobjective fractional programming (Q1321405) (← links)
- On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems (Q1952121) (← links)
- A study on vector variational-like inequalities using convexificators and application to its bi-level form (Q2171112) (← links)
- Necessary and sufficient conditions for efficiency via convexificators (Q2251552) (← links)
- (Q3010550) (← links)
- (Q3016924) (← links)
- The Karush–Kuhn–Tucker conditions for multiple objective fractional interval valued optimization problems (Q3389353) (← links)
- Necessary optimality conditions for a fractional multiobjective optimization problem (Q5002273) (← links)
- (Q5084217) (← links)
- (Q5858334) (← links)
- Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem (Q5940038) (← links)
- Sequential optimality conditions of approximate proper efficiency for a multiobjective fractional programming problem (Q6067531) (← links)
- Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem (Q6107695) (← links)
- Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints (Q6169208) (← links)
- On approximate strong KKT points of nonsmooth interval-valued mutiobjective optimization problems using convexificators (Q6621087) (← links)
- Constraint qualifications and optimality conditions for nonsmooth multiobjective mathematical programming problems with vanishing constraints on Hadamard manifolds via convexificators (Q6635232) (← links)