Nondifferentiable minimax fractional programming problems with (C, , , d)-convexity
From MaRDI portal
Publication:2370036
To relax the convexity assumptions imposed on the theorems on sufficient optimality conditions and duality, various generalized convexity notations have been proposed in the literature. In this paper the authors consider optimality conditions and duality theorems for the generalized fractional nondifferentiable programming in the framework of a new unified formulation of generalized convexity, called \((C,\alpha,\rho,d)\)-convexity.
Recommendations
- On nondifferentiable minimax fractional programming involving generalized (C,,,d)-convexity
- Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity
- Nondifferentiable minimax fractional programming problem with nonsmooth generalized convex functions
- Optimality and duality for nondifferentiable minimax fractional programming with generalized convexity
- Optimality conditions and duality for nondifferentiable multiobjective fractional programming problems with \((C,\alpha ,\rho ,d)\)-convexity
Cites work
- A characterization of strict local minimizers of order one for nonsmooth static minmax problems
- Duality for a class of nondifferentiable mathematical programming problems
- Duality for fractional minimax programming problems
- Efficiency conditions and duality for a class of multiobjective fractional programming problems
- Generalized (F, ρ)-convexity and duality for non smooth multi-objective programs
- scientific article; zbMATH DE number 3918106 (Why is no real title available?)
- scientific article; zbMATH DE number 798857 (Why is no real title available?)
- scientific article; zbMATH DE number 222438 (Why is no real title available?)
- Necessary conditions and sufficient conditions for static minmax problems
- On efficiency and duality for multiobjective programs
- On minimax fractional optimality conditions with invexity
- On sufficiency of the Kuhn-Tucker conditions
- Optimality and duality for generalized fractional programming involving nonsmooth pseudoindex functions
- Optimality conditions and duality for a class of nonlinear fractional programming problems.
- Optimality conditions and duality for a minimax fractional programming with generalized convexity
- Optimization and nonsmooth analysis
- Strong convexity of sets and functions
Cited in
(42)- Higher-order duality in nondifferentiable minimax programming with generalized type I functions
- On nondifferentiable minimax fractional programming under generalized -type I invexity
- On minimax fractional optimality conditions with \((F,\rho)\)-convexity
- On nonsmooth semi-infinite minimax programming problem with (, )-invexity
- Duality for nondifferentiable minimax fractional programming problem involving higher order \((C,\alpha, \rho, d)\)-convexity
- On nondifferentiable fractional minimax programming
- Non-differentiable vector programming problem and duality for higher-order cone convex functions
- The study higher-order Wolfe-type non-differentiable multiple objective symmetric duality involving generalized convex functions
- Correspondence between a new class of generalized cone convexity and higher order duality
- On duality for a second-order multiobjective fractional programming problem involving type-I functions
- Optimality conditions and duality for nondifferentiable multiobjective semi-infinite programming problems with generalized \((C,\alpha,\rho,d)\)-convexity
- Generalized minimax programming with nondifferentiable \((G, \beta)\)-invexity
- Multiobjective programming with new invexities
- Higher-order duality relations for multiobjective fractional problems involving support functions
- Duality in nondifferentiable multiobjective fractional programming problem with generalized invexity
- Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity
- Multiobjective programming problems with (G,C,)-convexity
- On second-order duality for a class of nondifferentiable minimax fractional programming problem with \((C,\alpha,\rho,d)\)-convexity
- Optimality and duality results for a nondifferentiable multiobjective fractional programming problem
- Solving the complex quadratic double-ratio minimax optimization under a quadratic constraint
- Semiinfinite multiobjective fractional programming. I: Sufficient efficiency conditions
- Nondifferentiable minimax fractional programming problem with nonsmooth generalized convex functions
- On nondifferentiable minimax fractional programming involving generalized (C,,,d)-convexity
- scientific article; zbMATH DE number 17945 (Why is no real title available?)
- Optimality and duality for minimax fractional programming with support function under (C, , , d)-convexity
- Optimality and duality for nondifferentiable minimax fractional programming with generalized convexity
- Nondifferentiable minimax fractional programming in complex spaces with parametric duality
- Minimax programming with (G,)-invexity
- scientific article; zbMATH DE number 6929529 (Why is no real title available?)
- scientific article; zbMATH DE number 6929533 (Why is no real title available?)
- Wolfe type higher order multiple objective nondifferentiable symmetric dual programming with generalized invex function
- On higher-order duality in nondifferentiable minimax fractional programming
- Higher order duality of multiobjective constrained ratio optimization problems
- scientific article; zbMATH DE number 7288685 (Why is no real title available?)
- Nonsmooth minimax fractional programming involving {\(\eta\)}-pseudolinear functions
- Higher-order (F, , , , d, E)-convexity in fractional programming
- Optimality conditions and duality for nondifferentiable multiobjective fractional programming problems with \((C,\alpha ,\rho ,d)\)-convexity
- On a general duality model in multiobjective fractional programming with \(n\)-set functions
- Second-order strong optimality and duality for nonsmooth multiobjective fractional programming with constraints
- Nonsmooth - ( , )-invexity in multiobjective programming problems
- Second order duality for nondifferentiable minimax programming problems with generalized convexity
- Multiobjective program with support functions under \((G,C,\rho)\)-convexity assumptions
This page was built for publication: Nondifferentiable minimax fractional programming problems with \((C, \alpha, \rho, d)\)-convexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2370036)
