IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v36y2024i3p787-819.html
   My bibliography  Save this article

Largest Volume Inscribed Rectangles in Convex Sets Defined by Finite Number of Inequalities

Author

Listed:
  • Mehdi Behroozi

    (Department of Mechanical and Industrial Engineering, Northeastern University, Boston, Massachusetts 02115)

Abstract

This paper considers the problem of finding maximum volume (axis-aligned) inscribed boxes in a compact convex set, defined by a finite number of convex inequalities, and presents optimization and geometric approaches for solving them. Several optimization models are developed that can be easily generalized to find other inscribed geometric shapes such as triangles, rhombi, and squares. To find the largest volume axis-aligned inscribed rectangles in the higher dimensions, an interior-point method algorithm is presented and analyzed. For two-dimensional space, a parametrized optimization approach is developed to find the largest area (axis-aligned) inscribed rectangles in convex sets. The optimization approach provides a uniform framework for solving a wide variety of relevant problems. Finally, two computational geometric ( 1 − ε ) –approximation algorithms with sublinear running times are presented that improve the previous results.

Suggested Citation

  • Mehdi Behroozi, 2024. "Largest Volume Inscribed Rectangles in Convex Sets Defined by Finite Number of Inequalities," INFORMS Journal on Computing, INFORMS, vol. 36(3), pages 787-819, May.
    • Handle: RePEc:inm:orijoc:v:36:y:2024:i:3:p:787-819
    DOI: 10.1287/ijoc.2022.0239
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ijoc.2022.0239
    Download Restriction: no
    File URL: https://libkey.io/10.1287/ijoc.2022.0239?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. John Carlsson & Mehdi Behroozi & Xiang Li, 2016. "Geometric partitioning and robust ad-hoc network design," Annals of Operations Research, Springer, vol. 238(1), pages 41-68, March.
    2. John Gunnar Carlsson & Fan Jia & Ying Li, 2014. "An Approximation Algorithm for the Continuous k -Medians Problem in a Convex Polygon," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 280-289, May.
    3. John Gunnar Carlsson & Mehdi Behroozi & Xiang Li, 2016. "Geometric partitioning and robust ad-hoc network design," Annals of Operations Research, Springer, vol. 238(1), pages 41-68, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Panov, P., 2017. "Nash Equilibria in the Facility Location Problem with Externalities," Journal of the New Economic Association, New Economic Association, vol. 33(1), pages 28-42.
    2. John Gunnar Carlsson & Fan Jia, 2015. "Continuous Facility Location with Backbone Network Costs," Transportation Science, INFORMS, vol. 49(3), pages 433-451, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orijoc:v:36:y:2024:i:3:p:787-819. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.