I'm looking for an algorithm that will let me optimally select items from a set. These items have properties which are involved in defining constraints as well as the objective function.
Say each item in the set has integer-valued properties
A, B, C. I need to select
n items (say 2, can pick any item at most once) such that the sum of the property B among all selected items is at least 50 and the sum of all C's is at least 60 (two constraints), and I need to maximize for sum of A.
Where should I start looking? I was pointed towards LP but am unable to formulate it since I'm looking to pick exact items from a set.