In this paper, Antczak’s -approximation approach is used to prove the equivalence between optima of multiobjective programming problems and the -saddle points of the associated -approximated vector optimisation problems. We introduce an -Lagrange function for a constructed -approximated vector optimisation problem and present some modified -saddle point results. Furthermore, we construct an -ap...

In this paper, the parametrically generalized sufficient efficiency conditions for multiobjective fractional programming based on the hybrid (Φ, ρ, η, ζ, θ)−invexities are developed, and then efficient solutions to the multiobjective fractional programming problems are established. Furthermore, the obtained results on sufficient efficiency conditions are generalized to the case of the ε−efficie...

The relationship between mathematical programming and classical calculus of variation was explored and extended by Hanson [6]. Thereafter variational programming problems have attracted some attention in literature. Duality for multiobjective variational problems has been of much interest in the recent years, and several contributions have been made to its development (see, e.g., Bector and Hus...