I have an optimization problem which am not able to figure out after much thought. Any suggestions on how to go about it are welcome. Thanks in advance.(adsbygoogle = window.adsbygoogle || []).push({});

given a set of 'n' numbers. I have to find the optimal disjoint subset distribution of the set which minimizes the value given by a function ( The function values over each of the subsets are added to give the total value corresponding to a subset distribution). There's no polynomial formula for the function, the value is computed using a set of rules based on previous results. The function value can be calculated using a code for a given set. The upper bound is the sum of all the numbers in the set and the lower bound is the largest number in the set.

The order of appearance of numbers in the subset is important (being time values). Within each susbset of the distribution an element appearing prior to a latter element should have a lower indice in the original set.

Any suggestion will be highly appreciated. Thanks to all

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Optimization problem

Loading...

Similar Threads for Optimization problem |
---|

A Maximization problem using Euler Lagrange |

A Maximization Problem |

I A question about Vector Analysis problems |

I Optimizing fractions and Lagrange Multiplier |

B Square root differential problem |

**Physics Forums | Science Articles, Homework Help, Discussion**