LAUSR

Disciplined geometric programming

Sign Up to like & get
recommendations!
0 Published in 2019 at "Optimization Letters"

DOI: 10.1007/s11590-019-01422-z

Abstract: We introduce log-log convex programs, which are optimization problems with positive variables that become convex when the variables, objective functions, and constraint functions are replaced with their logs, which we refer to as a log-log… read more here.

Keywords: log; log convex; geometric programming; disciplined geometric ... See more keywords