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

The generalized linear programming algorithm allows an arbitrary mathematical programming minimization problem to be analyzed as a sequence of linear programming approximations. Under fairly general ...