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

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

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

Introduction to the theory and solution methods of linear and nonlinear programming problems, including: linear programming duality, Lagrangian duality, convex programming and Karush-Kuhn-Tucker ...

The book also addresses linear programming duality theory and its use in algorithm design as well as the Dual Simplex Method, Dantzig-Wolfe decomposition, and a primal-dual interior point algorithm.

Perold, André, and R. Meidan. "Optimality Conditions and Strong Duality in Abstract and Continuous Time Linear Programming." Journal of Optimization Theory and Applications 40, no. 1 (May 1983): 61–76 ...

Stable Matchings, Optimal Assignments, and Linear Programming By: A. E. Roth, U. G. Rothblum and J. H. Vande Vate ...

"Using our previous results, we demonstrated that the duality operators can be realized as unitary linear-depth quantum circuits when supplementing the Hilbert space with ancillary degrees of ...