Un nuevo algoritmo en programacion signomial

DOI10.1007/BF02888263zbMATH Open0759.90081MaRDI QIDQ4022756FDOQ4022756

Authors: Antonio Pérez, A. I. Allueva 

Publication date: 17 January 1993

Published in: Trabajos de Investigacion Operativa (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/40628

Recommendations

• A decomposition method for signomial geometric programming with nonnegative degree of difficulty
• A global optimization algorithm for signomial geometric programming problem
• A new algorithm for geometric programming based on the linear structure of its dual problem.
• scientific article; zbMATH DE number 3883959
• scientific article; zbMATH DE number 1131980

zbMATH Keywords

signomial programming

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Geometric programming with signomials
• Geometric Programming: Methods, Computations and Applications
• Title not available (Why is that?)
• A Solution Procedure for Geometric Programming
• Some remarks on condensation methods for geometric programs

Cited In (9)

• Title not available (Why is that?)
• A decomposition method for signomial geometric programming with nonnegative degree of difficulty
• Signature Methods for the Assignment Problem
• A global convergent algorithm for mixed constrained signomial geometric programming
• Duality of a nonconvex sum of ratios
• Title not available (Why is that?)
• Title not available (Why is that?)
• MM algorithms for geometric and signomial programming
• Posynomial and signomial adjustment with the generation of monomials through non-linear programming methods

This page was built for publication: Un nuevo algoritmo en programacion signomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4022756)