> I was wondering if this is even possible. > given a list of plans... > > ... > > And given the user's input of say 10 lines and 9500 minutes. Is it > possible to come up with the least costly set up that meets the > requirements? For example. 10 lines 9,500 minutes would be > 1 @ PLANI = 210.00 (6000 minutes) > 7 @ PLANC = 294.00 (3500 minutes) > 2 @ PLANA = 50.00 (0 minutes) > total = 554.00 > > You'd think it'd be > 1 @ PLANI = 210.00 (6000 minutes) > 1 @ PLANG = 105.00 (2100 minutes) > 1 @ PLANF = 84.00 (1400 minutes) > so that satisfies the 9500 minute requirement > so the other lines would have to go to PLANA > 7 @ PLANA = 175.00 (0 minutes) > total = 574.00 > > Any ideas would be most helpful!
This sounds like a variation of the traveling salesman problem: http://en.wikipedia.org/wiki/Travelling_salesman_problem My comp sci knowledge and math skills aren't really good enough to help you come up with the best solution to your problem, but you might take a look at the various approximation algorithms out there to find a solution. Dave Watts, CTO, Fig Leaf Software http://www.figleaf.com/ Fig Leaf Software provides the highest caliber vendor-authorized instruction at our training centers in Washington DC, Atlanta, Chicago, Baltimore, Northern Virginia, or on-site at your location. Visit http://training.figleaf.com/ for more information! ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~| Want to reach the ColdFusion community with something they want? Let them know on the House of Fusion mailing lists Archive: http://www.houseoffusion.com/groups/cf-talk/message.cfm/messageid:326012 Subscription: http://www.houseoffusion.com/groups/cf-talk/subscribe.cfm Unsubscribe: http://www.houseoffusion.com/cf_lists/unsubscribe.cfm?user=89.70.4
