I need to for one carton at a time, actual weight ((sku1_weight * qty) + (sku2_weight * qty) +...), find the least heaviest weight (based on lowest possible package contents P->C->M->U; P is largest)

Sample Data
CARTON_ID SKU QTY B UNIT_WEIGHT (QTY*UNIT_WEIGHT)
--- -----------------
00000288745505982937 16271 S 6 M .027 .162
00000288745505982937 16272 S 3 M .036 .108
00000288745505982937 16273 S 3 M .063 .189
00000288745505982937 16905 S 3 M .145 .435
00000288745505982937 16912 5 M .125 .625
00000288745505982937 74-587 S 5 M .06 .3
00000288745505982937 DW1373 5 M .024 .12
00000288745505982937 DW1376 5 M .027 .135
00000288745505982937 DW1382 5 M .053 .265
00000288745505982937 DW1386 12 M .1167 1.4004
00000288745505982937 DW1392 3 M .1667 .5001
00000288745505982937 DW2003 Z 5 M .036 .18
00000288745505982937 DW2021 Z 5 M .05 .25
00000288745505982937 DW2022B8 5 U .17 .85
00000288745505982937 DW2024 Z 5 M .05 .25
00000288745505982937 DW2028 Z 5 M .05 .25
00000288745505982937 DW2032 Z 5 M .06 .3
00000288745505982937 DW2045 Z 10 M .085 .85
00000288745505982937 DW2046 Z 3 M .1033 .3099
00000288745505982937 DW2054 15 M .067 1.005
00000288745505982937 DW2067 Z 3 M .2 .6
00000288745505982937 DW2229 Z 3 M .2533 .7599
00000288745505982937 DW2232 Z 10 M .067 .67
00000288745505982937 DW3106 2 U 1.7 3.4
00000288745505982937 DW4811N25 75 M .045 3.375

First, I don't understand your question at all? I can identity that column 4 times column 6 equals column 7

Second, are you asking for a Unix shell script?

Please elaborate.