| Authors |
: |
|
| Document type |
: |
Article de périodique (Journal article) – Article de recherche
|
| Abstract |
: |
A general or signomial geometric program is a nonlinear mathematical program involving general polynomials in several variables both in the objective function and the constraints. A branch-and-bound method is proposed for this extensive class of nonconvex optimization program guaranteeing convergence to the global optimum. The subproblems to be solved are convex but the method can easily be combined with a cutting plane technique to generate subproblems which are linear. A simple example is given to illustrate the technique. |
| Access type |
: |
Accès restreint |
| Publication date |
: |
1979 |
| Journal information |
: |
"Operations Research" - Vol. 27, no. 5, p. 982-996 (1979) |
| Peer reviewed |
: |
yes |
| issn |
: |
0030-364X |
| Publication status |
: |
Publié |
| Affiliations |
: |
UCL
- FSA/INMA - Département d'ingénierie mathématique
UCL
- EUEN/CORE - Center for operations research and econometrics
|
| Links |
: |
|
