Huy wrote: > Hi Everyone, > > I would like to ask for your advice on a more specific > problem I am having: > > I am writing a program that searchs a decision tree > and makes decision at every choice point by comparing > the the expected reward of each branch. This reward > value is a linear function of several time variables, In the program you have given, constraints are only associated with the leaves of the tree, and only there do you need to solve a linear problem. The reward of the higher tree nodes then is trivial to compute by adding the node constants to the result of the subtrees. Does your actual problem really have this property? -- Joachim Schimpf / phone: +44 20 7594 8187 IC-Parc / mailto:J.Schimpf@imperial.ac.uk Imperial College London / http://www.icparc.ic.ac.uk/eclipseReceived on Tue Feb 22 18:20:27 2005
This archive was generated by hypermail 2.1.8 : Wed 16 Nov 2005 06:07:34 PM GMT GMT