MaximizenXj=1c j x j ,subject to:nXj=1ai j x j _ bi (i = 1, 2, . . . ,m),x j = 0 or 1 ( j = 1, 2, . . . , n).The objective is to maximize total contribution from all investments without exceeding the limited availability
This is the end of the preview.
access the rest of the document.
NX, Dative case, important special scenario, c jxj