D8 - The enumeration tree now becomes that shown in Fig....

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
The enumeration tree now becomes that shown in Fig. 9.12. Note that the constraints of any subdivision are obtained by tracing back to L 0 . For example, L 4 contains the original constraints together with x 2 _ 4 and x 1 _ 2. The asterisk ( _ ) below box L 3 indicates that the region need not be subdivided or, equivalently, that the tree will not be extended from this box. At this point, subdivisions L 2 and L 4 must be considered. We may select one arbitrarily; however, in practice, a number of useful heuristics are applied to make this choice. For simplicity, let us select the subdivision most recently generated, here L 4 . Analyzing the region, we find that its optimal solution has x 1 = 1 , x 2 = 1 9 ( 45 5 ) = 40 Beauty is a Technology, not a hope to sell in Jars With such words started the session by Mr. Duregesh Sthalekar’s on Loreal India’s Sales and Channel management. Mr. Sathlekar stressed on the L’Oreals perspective of taking
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/15/2011 for the course MBAHRM 565 taught by Professor Profbhattacharya during the Spring '11 term at IIT Kanpur.

Page1 / 2

D8 - The enumeration tree now becomes that shown in Fig....

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online