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

We investigate in this paper the Lagrangian duality properties of linear equality constrained binary quadratic programming. We derive an underestimation of the duality gap between the primal problem ...

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