Recently Schechter (in a Lehigh University report) formulated two dual linear programming problems over closed convex cones in quite general spaces and showed that, if precisely one of the problems is ...

This paper considers fluid analogues for the standard linear programming problem and for a separable nonlinear programming problem. In the former case the usual duality results are demonstrated using ...