Originally Posted by jim enright
example:
the bag can only hold 12 lbs.
you have the following items:
obj wt cost
1 3.8 3.8
2 3.8 3.8
3 3.8 3.8
4 3.0 2.9
5 3.0 2.9
6 3.0 2.9
7 3.0 2.9
the optimal solution is to pick the four lowest lowest cost and lowest cost
per lb objects. the example is contrived but the point is that this is
a difficult optimization problem that can only be solved by
sophisitcated integer programming techniques or sheer exhaustion
of the possibilites. strategies often work well but do not guarantee true "optimization".
dynamic programming relates to a series of sequential decisions through time or stages and typically is more of an art than an algorithm. but
integer programming can be classified as DP.