Mixed type duality for nondifferentiable multiobjective fractional programming under generalized (d,, , )-type 1 univex function
DOI10.1016/J.AMC.2013.03.044zbMATH Open1288.90122OpenAlexW2073780022MaRDI QIDQ2453318FDOQ2453318
Authors: A. K. Tripathy, Gayatri Devi
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
Recommendations
- Mixed type duality in non-differentiable multi-objective fractional programming under generalised \((\phi, \rho)\)-univex function
- Mixed type duality in multiobjective fractional programming under generalized \(\rho\)-univex function
- Higher order mixed type duality in nonsmooth multiobjective fractional programming involving generalized univex function
- scientific article; zbMATH DE number 6539425
- Generalized univex functions in nonsmooth multiobjective optimization
directional derivativefractional programmingweak efficient solutionmixed type dualitygeneralized type 1 univex function
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On mixed duality in mathematical programming.
- Multiobjective programming under \(d\)-invexity
- \(d-\rho -(\eta ,\theta )\)-invexity in multiobjective optimization
Cited In (6)
- Higher order mixed type duality in nonsmooth multiobjective fractional programming involving generalized univex function
- Higher order duality in multiobjective fractional programming with square root term under generalized higher order \((F, \alpha, \beta, \rho, \sigma, d)\)-V-type I univex functions
- Mixed type duality in multiobjective fractional programming under generalized \(\rho\)-univex function
- Mixed type duality in non-differentiable multi-objective fractional programming under generalised \((\phi, \rho)\)-univex function
- Sufficiency and duality for nonsmooth multiobjective fractional programming problems involving \((\Phi,\rho,\alpha)\)-\(V\)-invexity
- Optimality conditions for interval-valued univex programming
This page was built for publication: Mixed type duality for nondifferentiable multiobjective fractional programming under generalized \((d,\rho, \eta, \theta)\)-type 1 univex function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453318)