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 ...
This is a preview. Log in through your library . Abstract Model equivalences may sometimes be used to replace 'realistic' but unwieldy initial formulations with simpler counterparts. This can involve ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback