A multiobjective programming problem characterized by convex goal functions and linear inequality constraints is studied. The investigation aims to the construction of a multiobjective dual problem permitting the verification of strong duality as well as optimality conditions.  For the...

In this paper, we deal with the construction of gap functions for variational inequalities by using an approach which bases on the conjugate duality. Under certain assumptions we also investigate a further class of gap functions for the variational inequality problem, the so-called dual gap...

A multiobjective programming problem characterized by convex goal functions and linear inequality constraints is studied. The investigation aims to the construction of a multiobjective dual problem permitting the verification of strong duality as well as optimality conditions.  For the...