Abstract
Mathematical programming problems try to solve processes which have different solutions by finding the optimal solution, the one that best fits the pre-established conditions of the problem. The classic procedures work towards finding an optimal solution in the case of convex problems, but cannot guarantee it in any other type of problem. However, if the problem involves some kind of convexity, as for example when the objective function can be expressed as a difference in convex functions, then new procedures making it possible to calculate optimal solutions can be described. A new use of convexity was taken as the central axis in the discrimination of solutions in this study, with the aim of improving the efficiency in obtaining optimal solutions.
| Translated title of the contribution | A new criterion for optimizing mathematical problems resolution |
|---|---|
| Original language | Catalan |
| Pages (from-to) | 0001-2 |
| Number of pages | 2 |
| Journal | UAB Divulga |
| Publication status | Published - 2009 |