+ Reply to Thread
Results 1 to 2 of 2

complicated calculation

  1. #1
    Registered User
    Join Date
    06-04-2005
    Posts
    32

    complicated calculation

    Hi,
    anybody that would help would be very much thanked...
    I would like to find a way to solve a problem I am very often confronted with, and always have to solve by hand.
    Among a range of products, I have several possible lengths. For one product, I need to have several lengths. How can I calculate the most economic combination ?
    Example: I need 80+65+79+254+158+345+53 within a range of 240, 270, 300, 330, 360, 400. What should be the best combination so that the final total length is the smallest possible ?
    Good luck

  2. #2
    Forum Contributor
    Join Date
    03-13-2005
    Posts
    6,195
    Quote Originally Posted by doudou
    Hi,
    anybody that would help would be very much thanked...
    I would like to find a way to solve a problem I am very often confronted with, and always have to solve by hand.
    Among a range of products, I have several possible lengths. For one product, I need to have several lengths. How can I calculate the most economic combination ?
    Example: I need 80+65+79+254+158+345+53 within a range of 240, 270, 300, 330, 360, 400. What should be the best combination so that the final total length is the smallest possible ?
    Good luck
    If I read Pascal's Triangle correctly, there are 127 combinations of 7 numbers, which combinations you want to compare to be equal of less than 6 other legths to calculate the smallest wastage.

    Whilst this is not impossible, one method is as per the attached, where (for the first few combinations) the wastage is calculated for the combination, and the lowest figure is deemed to be the best fit, however, the remaining row patterns required will take some effort to complete, and I guess the question then remains as to whether you expend more effort doing that or doing the 'best fit' manually.
    (note, to view or set more formula, select Tools, Options, View and tick Formula, the pattern can be seen as will be required for columns A to G where the final row will be A =A1, B =B1, C =C1, D =D1, E =E1, F =F1 and G =G1)

    When all combinations are entered, the wastage is calculated for each pattern, and the total wastage for the row. (impossible lengths are flagged as 9999). The row with the smallest waste is reflected at M3

    Hope this helps, and maybe someone can organise a pattern generator for any combination of 1 to 7 from 7 to assist in the Row entries.


    Of course, if you then want 8, 9 or 10 lengths . . . . . (you will need a much bigger set of patterns)
    note, you need only setup the patterns for the largest combination required, it works for smallers sets, and you can extend the Lookup at A2:G2, amend the formula (currently) at I5 and formula-fill sideways and downwards.
    ---
    Attached Files Attached Files
    Last edited by Bryan Hessey; 10-16-2006 at 06:09 PM.
    Si fractum non sit, noli id reficere.

+ Reply to Thread

Thread Information

Users Browsing this Thread

There are currently 1 users browsing this thread. (0 members and 1 guests)

Bookmarks

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts

Search Engine Friendly URLs by vBSEO 3.6.0 RC 1