LISTSERV at the University of Georgia
Menubar Imagemap
Home Browse Manage Request Manuals Register
Previous messageNext messagePrevious in topicNext in topicPrevious by same authorNext by same authorPrevious page (March 2005)Back to main SPSSX-L pageJoin or leave SPSSX-L (or change settings)ReplyPost a new messageSearchProportional fontNon-proportional font
Date:         Thu, 3 Mar 2005 13:47:58 -0800
Reply-To:     "Theise, Eric" <>
Sender:       "SPSSX(r) Discussion" <SPSSX-L@LISTSERV.UGA.EDU>
From:         "Theise, Eric" <>
Subject:      Re: TOP 10 COMBINATIONS
Comments: To: Victor Tarragó <>
Content-Type: text/plain; charset=iso-8859-1


I joined the list recently, and believe I missed the first few posts on this topic.

From a brief reading of Victor's message, it seems that this is some sort of a constrained optimization problem, and that it would be best solved by using a linear or integer programming package. Rather, the "best" solution could be determined from that sort of analysis, and either a subsequent sensitivity analysis or a complete enumeration could generate the top ten combinations.

It's been a while since I've formulated and solved such a problem, but I'd be happy to take a look after-work if you wanted to contact me off-list.


Back to: Top of message | Previous page | Main SPSSX-L page