This is a preview. Log in through your library . Abstract Recently Schechter (in a Lehigh University report) formulated two dual linear programming problems over closed convex cones in quite general ...

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 ...

Roughly, we will cover the following topics (some of them may be skipped depending on the time available). Linear Programming: Basics, Simplex Algorithm, and Duality. Applications of Linear ...