Multiobjective fractional symmetric duality in mathematical programming with \((C,G_f)\)-invexity assumptions
From MaRDI portal
Publication:2306632
DOI10.3390/axioms8030097zbMath1432.90122OpenAlexW2967801541WikidataQ127375175 ScholiaQ127375175MaRDI QIDQ2306632
C. Cesarano, Lakshmi Narayan Mishra, Ramu Dubey
Publication date: 24 March 2020
Published in: Axioms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/axioms8030097
Related Items (5)
Unified integral operator inequalities via convex composition of two functions ⋮ King type generalization of Baskakov operators based on \((p,q)\) calculus with better approximation properties ⋮ Dynamic Pricing Policy Using Preservation Technology with Stock and Price Sensitive Demand ⋮ Some results for a class of extended centralizers on C∗-algebras ⋮ Sequences of numbers via permutation polynomials over some finite rings
Cites Work
- Optimality conditions and duality for nondifferentiable multiobjective fractional programming problems with \((C,\alpha ,\rho ,d)\)-convexity
- New optimality conditions and duality results of \(G\) type in differentiable mathematical programming
- On \(G\)-invex multiobjective programming. I: Optimality
- On sufficiency of the Kuhn-Tucker conditions
- Multiobjective programming with new invexities
- Optimality conditions of the \(G\)-type in locally Lipschitz multiobjective programming
- Optimality conditions and duality in multiobjective programming with invexity
- What is invexity?
- Multiobjective fractional duality
- Duality for Multiple Objective Convex Programs
- Duality relations for second-order programming problem under (G,αf)-bonvexity assumptions
- Symmetric duality results for second-order nondifferentiable multiobjective programming problem
This page was built for publication: Multiobjective fractional symmetric duality in mathematical programming with \((C,G_f)\)-invexity assumptions
