{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

D6 - Maximize nX j=1 c jxj subject to nX j=1 ai j x j bi(i...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Maximize n X j = 1 c j x j , subject to: n X j = 1 a i j x j _ b i ( 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
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}