IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v7y2019i4p367-d224967.html
   My bibliography  Save this article

Solving ODEs by Obtaining Purely Second Degree Multinomials via Branch and Bound with Admissible Heuristic

Author

Listed:
  • Coşar Gözükırmızı

    (Computer Engineering Department, Beykent University, Ayazaga, Istanbul 34485, Turkey)

  • Metin Demiralp

    (Computational Science and Engineering Department, Istanbul Technical University, Ayazaga, Istanbul 34469, Turkey)

Abstract

Probabilistic evolution theory (PREVTH) forms a framework for the solution of explicit ODEs. The purpose of the paper is two-fold: (1) conversion of multinomial right-hand sides of the ODEs to purely second degree multinomial right-hand sides by space extension; (2) decrease the computational burden of probabilistic evolution theory by using the condensed Kronecker product. A first order ODE set with multinomial right-hand side functions may be converted to a first order ODE set with purely second degree multinomial right-hand side functions at the expense of an increase in the number of equations and unknowns. Obtaining purely second degree multinomial right-hand side functions is important because the solution of such equation set may be approximated by probabilistic evolution theory. A recent article by the authors states that the ODE set with the smallest number of unknowns can be found by searching. This paper gives the details of a way to search for the optimal space extension. As for the second purpose of the paper, the computational burden can be reduced by considering the properties of the Kronecker product of vectors and how the Kronecker product appears within the recursion of PREVTH: as a Cauchy product structure.

Suggested Citation

  • Coşar Gözükırmızı & Metin Demiralp, 2019. "Solving ODEs by Obtaining Purely Second Degree Multinomials via Branch and Bound with Admissible Heuristic," Mathematics, MDPI, vol. 7(4), pages 1-23, April.
  • Handle: RePEc:gam:jmathe:v:7:y:2019:i:4:p:367-:d:224967
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/7/4/367/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/7/4/367/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. E. L. Lawler & D. E. Wood, 1966. "Branch-and-Bound Methods: A Survey," Operations Research, INFORMS, vol. 14(4), pages 699-719, August.
    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. Kezong Tang & Xiong-Fei Wei & Yuan-Hao Jiang & Zi-Wei Chen & Lihua Yang, 2023. "An Adaptive Ant Colony Optimization for Solving Large-Scale Traveling Salesman Problem," Mathematics, MDPI, vol. 11(21), pages 1-26, October.
    2. Amine Lamine & Mahdi Khemakhem & Brahim Hnich & Habib Chabchoub, 2016. "Solving constrained optimization problems by solution-based decomposition search," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 672-695, October.
    3. Weiqiang Pan & Zhilong Shan & Ting Chen & Fangjiong Chen & Jing Feng, 2016. "Optimal pilot design for OFDM systems with non-contiguous subcarriers based on semi-definite programming," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 63(2), pages 297-305, October.
    4. Drexl, Andreas, 1990. "Scheduling of project networks by job assignment," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 247, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    5. Yi-Feng Hung & Wei-Chih Chen, 2011. "A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm," Journal of Global Optimization, Springer, vol. 51(1), pages 133-148, September.
    6. Fox, B. L. & Lenstra, J. K. & Rinnooy Kan, A. H. G. & Schrage, L. E., 1977. "Branching From The Largest Upper Bound: Folklore And Facts," Econometric Institute Archives 272158, Erasmus University Rotterdam.
    7. Thomas L. Morin & Roy E. Marsten, 1974. "Brand-and-Bound Strategies for Dynamic Programming," Discussion Papers 106, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    8. Baghersad, Milad & Emadikhiav, Mohsen & Huang, C. Derrick & Behara, Ravi S., 2023. "Modularity maximization to design contiguous policy zones for pandemic response," European Journal of Operational Research, Elsevier, vol. 304(1), pages 99-112.
    9. Hu, Xiaoxuan & Zhu, Waiming & Ma, Huawei & An, Bo & Zhi, Yanling & Wu, Yi, 2021. "Orientational variable-length strip covering problem: A branch-and-price-based algorithm," European Journal of Operational Research, Elsevier, vol. 289(1), pages 254-269.
    10. Notte, Gastón & Pedemonte, Martín & Cancela, Héctor & Chilibroste, Pablo, 2016. "Resource allocation in pastoral dairy production systems: Evaluating exact and genetic algorithms approaches," Agricultural Systems, Elsevier, vol. 148(C), pages 114-123.
    11. Chao Zhang & Zihao Zhang & Mihai Cucuringu & Stefan Zohren, 2021. "A Universal End-to-End Approach to Portfolio Optimization via Deep Learning," Papers 2111.09170, arXiv.org.
    12. Dusseault, Bernard & Pasquier, Philippe, 2021. "Usage of the net present value-at-risk to design ground-coupled heat pump systems under uncertain scenarios," Renewable Energy, Elsevier, vol. 173(C), pages 953-971.
    13. Juan F. R. Herrera & José M. G. Salmerón & Eligius M. T. Hendrix & Rafael Asenjo & Leocadio G. Casado, 2017. "On parallel Branch and Bound frameworks for Global Optimization," Journal of Global Optimization, Springer, vol. 69(3), pages 547-560, November.
    14. Gautam Mitra & Frank Ellison & Alan Scowcroft, 2007. "Quadratic programming for portfolio planning: Insights into algorithmic and computational issues Part II — Processing of portfolio planning models with discrete constraints," Journal of Asset Management, Palgrave Macmillan, vol. 8(4), pages 249-258, November.
    15. Efrat Taig & Ohad Ben-Shahar, 2019. "Gradient Surfing: A New Deterministic Approach for Low-Dimensional Global Optimization," Journal of Optimization Theory and Applications, Springer, vol. 180(3), pages 855-878, March.
    16. Pedroso, João Pedro, 2020. "Heuristics for packing semifluids," European Journal of Operational Research, Elsevier, vol. 282(3), pages 823-834.
    17. Miguel Lobo & Maryam Fazel & Stephen Boyd, 2007. "Portfolio optimization with linear and fixed transaction costs," Annals of Operations Research, Springer, vol. 152(1), pages 341-365, July.
    18. Irvin J. Lustig & Jean-François Puget, 2001. "Program Does Not Equal Program: Constraint Programming and Its Relationship to Mathematical Programming," Interfaces, INFORMS, vol. 31(6), pages 29-53, December.
    19. Mohsen Emadikhiav & David Bergman & Robert Day, 2020. "Consistent Routing and Scheduling with Simultaneous Pickups and Deliveries," Production and Operations Management, Production and Operations Management Society, vol. 29(8), pages 1937-1955, August.
    20. Takahashi, Taro & Aizaki, Hideo & Ge, Yingchun & Ma, Mingguo & Nakashima, Yasuhiro & Sato, Takeshi & Wang, Weizhen & Yamada, Nanae, 2013. "Agricultural water trade under farmland fragmentation: A simulation analysis of an irrigation district in northwestern China," Agricultural Water Management, Elsevier, vol. 122(C), pages 63-66.

    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:gam:jmathe:v:7:y:2019:i:4:p:367-:d:224967. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.