On the complexity of robust geometric programming with polyhedral uncertainty

André B. Chassein, Marc Goerigk. On the complexity of robust geometric programming with polyhedral uncertainty. Oper. Res. Lett., 47(1):21-24, 2019. [doi]

Abstract

Abstract is missing.