Mixed type duality for nondifferentiable multiobjective fractional programming under generalized \((d,\rho, \eta, \theta)\)-type 1 univex function
DOI10.1016/j.amc.2013.03.044zbMath1288.90122OpenAlexW2073780022MaRDI QIDQ2453318
Gayatri Devi, Arun Kumar Tripathy
Publication date: 6 June 2014
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2013.03.044
fractional programmingdirectional derivativeweak efficient solutionmixed type dualitygeneralized type 1 univex function
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(d-\rho -(\eta ,\theta )\)-invexity in multiobjective optimization
- On nonlinear multiple objective fractional programming involving semilocally type-I univex functions
- Optimality criteria in mathematical programming involving generalized invexity
- On sufficiency of the Kuhn-Tucker conditions
- \(D\)-invexity and optimality conditions
- On multiple-objective optimization with generalized univexity
- Optimality conditions and duality in subdifferentiable multiobjective fractional programming
- Optimality and duality for multiple-objective optimization under generalized type I univexity
- Nondifferentiable multiobjective programming under generalized \(d\)-univexity
- Mixed type duality in multiobjective programming problems
- On mixed symmetric duality in multiobjective programming.
- What is invexity?
- Necessary and sufficient conditions in constrained optimization
- On mixed duality in mathematical programming.
- Multiobjective programming under \(d\)-invexity
This page was built for publication: Mixed type duality for nondifferentiable multiobjective fractional programming under generalized \((d,\rho, \eta, \theta)\)-type 1 univex function