A CONVEX APPROXIMANT METHOD FOR NONCONVEX EXTENSIONS OF GEOMETRIC PROGRAMMING*
AUTOR(ES)
Charnes, A.
ACESSO AO ARTIGO
http://www.pubmedcentral.nih.gov/articlerender.fcgi?artid=219979Documentos Relacionados
- A new primal-dual path-following method for convex quadratic programming
- Using sentinels to detect intersections of convex and nonconvex polygons
- Lagrange Multiplier Method for Convex Programs
- A numerical implementation of an interior point method for semidefinite programming
- GEOMETRIC PROGRAMMING, CHEMICAL EQUILIBRIUM, AND THE ANTI-ENTROPY FUNCTION*