IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v63y2016i1p203-236.html
   My bibliography  Save this article

Global optimization of trusses with constraints on number of different cross-sections: a mixed-integer second-order cone programming approach

Author

Listed:
  • Yoshihiro Kanno

Abstract

In design practice it is often that the structural components are selected from among easily available discrete candidates and a number of different candidates used in a structure is restricted to be small. Presented in this paper is a new modeling of the design constraints for obtaining the minimum compliance truss design in which only a limited number of different cross-section sizes are employed. The member cross-sectional areas are considered either discrete design variables that can take only predetermined values or continuous design variables. In both cases it is shown that the compliance minimization problem can be formulated as a mixed-integer second-order cone programming problem. The global optimal solution of this optimization problem is then computed by using an existing solver based on a branch-and-cut algorithm. Numerical experiments are performed to show that the proposed approach is applicable to moderately large-scale problems. Copyright Springer Science+Business Media New York 2016

Suggested Citation

  • Yoshihiro Kanno, 2016. "Global optimization of trusses with constraints on number of different cross-sections: a mixed-integer second-order cone programming approach," Computational Optimization and Applications, Springer, vol. 63(1), pages 203-236, January.
    • Handle: RePEc:spr:coopap:v:63:y:2016:i:1:p:203-236
    DOI: 10.1007/s10589-015-9766-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-015-9766-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10589-015-9766-0?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Juan Pablo Vielma & Shabbir Ahmed & George L. Nemhauser, 2008. "A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 438-450, August.
    2. S. Bollapragada & O. Ghattas & J. N. Hooker, 2001. "Optimal Design of Truss Structures by Logic-Based Branch and Cut," Operations Research, INFORMS, vol. 49(1), pages 42-51, February.
    3. Adelaide Cerveira & Agostinho Agra & Fernando Bastos & Joaquim Gromicho, 2013. "A new Branch and Bound method for a discrete truss topology design problem," Computational Optimization and Applications, Springer, vol. 54(1), pages 163-187, January.
    4. Mathias Stolpe, 2015. "Truss topology optimization with discrete design variables by outer approximation," Journal of Global Optimization, Springer, vol. 61(1), pages 139-163, January.
    5. Wolfgang Achtziger & Mathias Stolpe, 2009. "Global optimization of truss topology with discrete bar areas—Part II: Implementation and numerical results," Computational Optimization and Applications, Springer, vol. 44(2), pages 315-341, November.
    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. Adelaide Cerveira & Agostinho Agra & Fernando Bastos & Joaquim Gromicho, 2013. "A new Branch and Bound method for a discrete truss topology design problem," Computational Optimization and Applications, Springer, vol. 54(1), pages 163-187, January.
    2. Mathias Stolpe, 2015. "Truss topology optimization with discrete design variables by outer approximation," Journal of Global Optimization, Springer, vol. 61(1), pages 139-163, January.
    3. John N. Hooker, 2002. "Logic, Optimization, and Constraint Programming," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 295-321, November.
    4. Renaud Chicoisne, 2023. "Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes," Computational Optimization and Applications, Springer, vol. 84(3), pages 789-831, April.
    5. Tiwari, Richa & Jayaswal, Sachin & Sinha, Ankur, 2021. "Alternate solution approaches for competitive hub location problems," European Journal of Operational Research, Elsevier, vol. 290(1), pages 68-80.
    6. Rui Pedro Brito & Hélder Sebastião & Pedro Godinho, 2015. "Portfolio Management With Higher Moments: The Cardinality Impact," GEMF Working Papers 2015-15, GEMF, Faculty of Economics, University of Coimbra.
    7. de Meijer, Frank, 2023. "Integrality and cutting planes in semidefinite programming approaches for combinatorial optimization," Other publications TiSEM b1f1088c-95fe-4b8a-9e15-c, Tilburg University, School of Economics and Management.
    8. Fatma Kılınç-Karzan, 2016. "On Minimal Valid Inequalities for Mixed Integer Conic Programs," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 477-510, May.
    9. Dimitris Bertsimas & Ryan Cory-Wright, 2022. "A Scalable Algorithm for Sparse Portfolio Selection," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1489-1511, May.
    10. Amir Ahmadi-Javid & Pooya Hoseinpour, 2022. "Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2621-2633, September.
    11. Tómasson, Egill & Hesamzadeh, Mohammad Reza & Wolak, Frank A., 2020. "Optimal offer-bid strategy of an energy storage portfolio: A linear quasi-relaxation approach," Applied Energy, Elsevier, vol. 260(C).
    12. J. Cole Smith, 2019. "In Memoriam: Shabbir Ahmed (1969–2019)," INFORMS Journal on Computing, INFORMS, vol. 31(4), pages 633-635, October.
    13. Krokhmal, Pavlo A. & Soberanis, Policarpio, 2010. "Risk optimization with p-order conic constraints: A linear programming approach," European Journal of Operational Research, Elsevier, vol. 201(3), pages 653-671, March.
    14. Erfan Mehmanchi & Andrés Gómez & Oleg A. Prokopyev, 2019. "Fractional 0–1 programs: links between mixed-integer linear and conic quadratic formulations," Journal of Global Optimization, Springer, vol. 75(2), pages 273-339, October.
    15. Nasim Dehghan Hardoroudi & Abolfazl Keshvari & Markku Kallio & Pekka Korhonen, 2017. "Solving cardinality constrained mean-variance portfolio problems via MILP," Annals of Operations Research, Springer, vol. 254(1), pages 47-59, July.
    16. M. Selim Aktürk & Alper Atamtürk & Sinan Gürel, 2014. "Aircraft Rescheduling with Cruise Speed Control," Operations Research, INFORMS, vol. 62(4), pages 829-845, August.
    17. Madani Bezoui & Mustapha Moulaï & Ahcène Bounceur & Reinhardt Euler, 2019. "An iterative method for solving a bi-objective constrained portfolio optimization problem," Computational Optimization and Applications, Springer, vol. 72(2), pages 479-498, March.
    18. Joey Huchette & Joey Huchette, 2019. "A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints," Mathematics of Operations Research, INFORMS, vol. 44(3), pages 793-820, August.
    19. Lagos, Guido & Espinoza, Daniel & Moreno, Eduardo & Vielma, Juan Pablo, 2015. "Restricted risk measures and robust optimization," European Journal of Operational Research, Elsevier, vol. 241(3), pages 771-782.
    20. Mohammad R. Oskoorouchi & Hamid R. Ghaffari & Tamás Terlaky & Dionne M. Aleman, 2011. "An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application," Operations Research, INFORMS, vol. 59(5), pages 1184-1197, October.

    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:spr:coopap:v:63:y:2016:i:1:p:203-236. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.