References

[Ben-Tal, 1999] Ben-Tal, A., and Nemirovski, A., “Robust solutions of uncertain linear programs,” Operations Research Letters, 1999.

[Chassein, 2014] Chassein, A., and Goerigk, M., “Robust Geometric Programming is co-NP hard.”, Fachbereich Mathematik, Technische Universitat Kaiserslautern, Germany, 2014, pp. 1–6.

[Hsiung, 2008] Hsiung, K. L., Kim, S. J., and Boyd, S., “Tractable approximate robust geometric programming,” Optimization and Engineering, vol. 9, 2008, pp. 95–118.

[Ozturk, 2019] Ozturk, B. and Saab, A., “Optimal Aircraft Design Decisions Under Uncertainty via Robust Signomial Programming”, AIAA Aviation 2019 Conference Proceedings.

[Saab, 2018] Saab, A., Burnell, E., and Hoburg, W., “Robust Designs via Geometric Programming”, arXiv:1808.07192v1.

[Soyster, 1974] Soyster, A.L., “A Duality Theory for Convex Programming with Set-Inclusive Constraints”, Operations Research, Vol. 22, No. 4, August 1974.

Work in progress…