A modified version of Generalized Programming is presented for solving convex programming problems. The procedure uses convenient linear approximations of the gradient of the dual in order to ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback