Abstract
Weakly efficient points of a mapping F : S → Y are characterized, where the feasible set S is given by infinitely many constraints, and Y is equipped with an arbitrary convex ordering. In the linear and in the convex case a necessary and sufficient condition is given, which needs no constraint qualification.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have