What is the best way to solve and assign values to constraints with multiple weights, for the best value?

[wirelessuser0118]

Thank you in advance for any suggestions. I have tried looking up SOLVER, GOAL SEEK, and most recently KNAPSACK. I'm not sure what is best., or if it is possible.

There are 3 types: BASIC, SMART, and DEVICE

In this particular group there are
17 BASICs

48 SMARTs

22 DEVICEs


Now here's the difficult part, The three types have different weights to them.

BASIC:
Weight: .01 | Value: $35

SMART:
Weight: 2 | Value: $65
Weight: 4 | Value: $75
Weight: 6 | Value: $85
Weight: 8 | Value: $95
Weight: 10 | Value: $105

DEVICE:
Weight: 2 | Value: $65
Weight: 4 | Value: $75
Weight: 6 | Value: $85
Weight: 8 | Value: $95
Weight: 10 | Value: $105

GOAL: 265
VALUE: Best price

What I want to solve is given the type constraints, what combination of their options would match a Weight of 265 at the best Value? Possibly, but not necessarily providing different outcomes. Even if it's not perfect, just having the tool as a base to work off of will be helpful.

I will be using this on a variety of different groups, so it seems solver would have to be programmed each time to different numbers of TYPES, how would I go about automating this?