Example: bankruptcy

Integer Programming 9

274 Integer Programming 9.1 subject to: Xn j=1 aj xj ≤ b, xj = 0 or 1 (j = 1,2,...,n). Usually, this problem is called the 0–1 knapsack problem, since it is analogous to a situation in which a hiker must decide which goods to include on his trip. Here cj is the ‘‘value’’ or utility of including good j,

Tags:

  Programming, Integre, Integer programming 9, 274 integer programming 9

Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries