programming problems over closed convex cones in quite general spaces and showed that, if precisely one of the problems is feasible, then the feasible one has infinite value. In this paper we obtain a ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback