Duality models for multiobjective semiinfinite fractional programming problems involving type-I and related functions

DOI10.2989/16073606.2018.1509906zbMath1425.90121OpenAlexW2894179252MaRDI QIDQ5243389

Pooja Gupta, Shashi Kant Mishra, Ram N. Mohapatra

Publication date: 18 November 2019

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2989/16073606.2018.1509906

zbMATH Keywords

dualityefficient solutionssemiinfinite programming

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Semi-infinite programming (90C34)

Related Items (1)

Efficiency for variational control problems on Riemann manifolds with geodesic quasiinvex curvilinear integral functionals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parametric duality models for semiinfinite multiobjective fractional programming problems containing generalized \((\alpha, \eta, \rho)\)-V-invex functions
• Generalized convexity and vector optimization.
• Duality for nonsmooth semi-infinite programming problems
• On efficiency and duality for multiobjective programs
• Optimality criteria and duality in multiple-objective optimization involving generalized invexity
• Efficiency conditions and duality for a class of multiobjective fractional programming problems
• Global parametric sufficient efficiency conditions for semiinfinite multiobjective fractional programming problems containing generalized \((\alpha,\eta,\rho)\)-V-invex functions
• Global semiparametric sufficient efficiency conditions for semiinfinite multiobjective fractional programming problems containing generalized \((\alpha, \eta,\rho)\)-V-invex functions
• Second order \((\Phi, \rho)\)-\(V\)-invexity and duality for semi-infinite minimax fractional programming
• Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
• OPTIMALITY CONDITIONS AND DUALITY FOR SEMI-INFINITE PROGRAMMING INVOLVING SEMILOCALLY TYPE I-PREINVEX AND RELATED FUNCTIONS
• DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
• Semi-infinite programming, duality, discretization and optimality conditions†
• Further Generalizations of Convexity in Mathematical Programming
• On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
• Multiobjective programming under generalized type I invexity

This page was built for publication: Duality models for multiobjective semiinfinite fractional programming problems involving type-I and related functions