Programming theory is treated initially without any assumptions about the functions and with interpretation for production and activity analysis. By proof of a general theorem about optimal and ...

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