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

zbMATH Open1413.90283MaRDI QIDQ4685167FDOQ4685167

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

Publication date: 5 October 2018

Recommendations

• On minimax fractional programming problems involving generalized \((H_p,r)\)-invex functions
• Minmax programming problems with \((p,r)-\rho-(\eta,\theta)\)-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

zbMATH Keywords

efficiencysufficiencydualityminimax fractional programming\((p,r)-\rho-(\eta,\theta)\)-invexity

Mathematics Subject Classification ID

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

Cited In (9)

• Pseudoinvex functions on Riemannian manifolds and applications in fractional programming problems
• Minimax programming under \((p,r)\)-invexity
• Minmax programming problems with \((p,r)-\rho-(\eta,\theta)\)-invexity
• Title not available (Why is that?)
• Higher order strict global minimizers in non-differentiable multiobjective optimization involving higher order invexity and variational inequality
• A taxonomy and review of the multi-objective fractional programming (MOFP) problems
• Duality for multiobjective optimization problem with vanishing constraints
• On minimax fractional programming problems involving generalized \((H_p,r)\)-invex functions
• Minimax fractional programming involving generalised invex functions

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)