Minimax fractional programming problem with (p,r)--(,)-invex functions

MaRDI QIDQ4685167zbMATH OpenFDO

Authors Andreea Mădălina Stancu, Anurag Jayswal, I. M. Stancu-Minasian

Publication date 5 October 2018

zbMATH Keywords

\((p,r)-\rho-(\eta,\theta)\)-invexitydualityefficiencyminimax fractional programmingsufficiency

Mathematics Subject Classification ID

Duality theory (optimization) (49N15) Fractional programming (90C32) Optimality conditions and duality in mathematical programming (90C46) Minimax problems in mathematical programming (90C47)

Recommendations

• On minimax fractional programming problems involving generalized \((H_p,r)\)-invex functions
• Minmax programming problems with (p,r)--(,)-invexity
• Multiobjective fractional programming problems involving \((p,r)\)-\(\rho\)-\((\eta,\theta)\)-invex function
• Minimax programming under (p,r)-invexity
• scientific article; zbMATH DE number 1757296

Cited in

(9)

• Minmax programming problems with (p,r)--(,)-invexity
• A taxonomy and review of the multi-objective fractional programming (MOFP) problems
• Minimax programming under (p,r)-invexity
• On minimax fractional programming problems involving generalized \((H_p,r)\)-invex functions
• Minimax fractional programming involving generalised invex functions
• Pseudoinvex functions on Riemannian manifolds and applications in fractional programming problems
• Duality for multiobjective optimization problem with vanishing constraints
• scientific article; zbMATH DE number 2221170 (Why is no real title available?)
• Higher order strict global minimizers in non-differentiable multiobjective optimization involving higher order invexity and variational inequality

This page was built for publication: Minimax fractional programming problem with \((p,r)-\rho-(\eta,\theta)\)-invex functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4685167)