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 ...
Let Γ(X) denote the proper, lower semicontinuous, convex functions on a normed linear space, and let Γ*(X*) denote the proper, weak*-lower semicontinuous, convex functions on the dual X* of X. It is ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback