This paper addresses the issue of which strong duality holds between parametric robust semi-definite linear optimization problems and their dual programs. In the case of a spectral norm uncertainty ...

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

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

Marshall, Paul W. "Linear Programming: A Technique for Analyzing Resource Allocation Problems." Harvard Business School Background Note 171-322, January 1971. (Revised November 1975.) ...

Integer linear programming can help find the answer to a variety of real-world problems. Now researchers have found a much faster way to do it. The traveling salesperson problem is one of the oldest ...