Largest Volume Inscribed Rectangles in Convex Sets Defined by Finite Number of Inequalities
Published Online:22 Jan 2024https://doi.org/10.1287/ijoc.2022.0239
Supplemental Material
Code and Data Repository: 2022.0239-master.cd.zip
Volume 36, Issue 3
May-June 2024
Pages 705-937, C2
Article Information
Supplemental Material
Metrics
Information
- Received:August 08, 2022
- Accepted:August 31, 2023
- Published Online:January 22, 2024
Copyright © 2024, INFORMS
Cite as
Mehdi Behroozi (2024) Largest Volume Inscribed Rectangles in Convex Sets Defined by Finite Number of Inequalities. INFORMS Journal on Computing 36(3):787-819.
https://doi.org/10.1287/ijoc.2022.0239
Keywords
The author is indebted to Shuzhong Zhang and Gilad Lerman for various comments and key observations that helped the derivation of some of the results. The author also thanks the two anonymous reviewers, associate editor, area editor, and editor-in-chief for constructive and invaluable comments and suggestions that helped improve this paper substantially.
