An Efficient Branch-and-Bound Algorithm for Globally Minimizing a Class of Generalized Linear Multiplicative Programs
This study presents a novel algorithm for globally solving generalized linear multiplicative programming (GLMP) problems. We first introduce a convex-separation technique to craft a tight yet computationally tractable linear relaxation that supplies strong lower bounds for the original nonconvex for...
Αποθηκεύτηκε σε:
| Κύριοι συγγραφείς: | , , , , |
|---|---|
| Μορφή: | Artigo |
| Γλώσσα: | Inglês |
| Έκδοση: |
Wiley
2025-01-01
|
| Σειρά: | Journal of Mathematics |
| Διαθέσιμο Online: | http://dx.doi.org/10.1155/jom/4452933 |
| Ετικέτες: |
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|