IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v156y2013i1d10.1007_s10957-012-0211-6.html
   My bibliography  Save this article

Conditional Optimization Problems: Fractional Order Case

Author

Listed:
  • Abolhassan Razminia

    (Persian Gulf University)

  • Dumitru Baleanu

    (Cankaya University
    King Abdulaziz University
    Institute of Space Sciences)

  • Vahid Johari Majd

    (Tarbiat Modares University)

Abstract

In this manuscript, we introduce a new formulation for the constrained optimization problems in which the objective function is considered in the fractional integral form. The constraints are applied in two separate cases, namely, fractional differential and fractional isoperimetric constraints. In both cases, by using the extended Euler–Lagrange equations and the Lagrange multiplier method, the necessary conditions are obtained. An example is given in order to illustrate the effectiveness of the reported results.

Suggested Citation

  • Abolhassan Razminia & Dumitru Baleanu & Vahid Johari Majd, 2013. "Conditional Optimization Problems: Fractional Order Case," Journal of Optimization Theory and Applications, Springer, vol. 156(1), pages 45-55, January.
    • Handle: RePEc:spr:joptap:v:156:y:2013:i:1:d:10.1007_s10957-012-0211-6
    DOI: 10.1007/s10957-012-0211-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-012-0211-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-012-0211-6?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. Chung, Chia-Shin & Flynn, James & Kirca, Omer, 2002. "A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems," International Journal of Production Economics, Elsevier, vol. 79(3), pages 185-196, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dumitru Baleanu & Amin Jajarmi & Mojtaba Hajipour, 2017. "A New Formulation of the Fractional Optimal Control Problems Involving Mittag–Leffler Nonsingular Kernel," Journal of Optimization Theory and Applications, Springer, vol. 175(3), pages 718-737, December.
    2. Razminia, Kambiz & Razminia, Abolhassan & Baleanu, Dumitru, 2019. "Fractal-fractional modelling of partially penetrating wells," Chaos, Solitons & Fractals, Elsevier, vol. 119(C), pages 135-142.
    3. Yiheng Wei & Bin Du & Songsong Cheng & Yong Wang, 2017. "Fractional Order Systems Time-Optimal Control and Its Application," Journal of Optimization Theory and Applications, Springer, vol. 174(1), pages 122-138, July.

    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. Bai, Danyu & Tang, Mengqian & Zhang, Zhi-Hai & Santibanez-Gonzalez, Ernesto DR, 2018. "Flow shop learning effect scheduling problem with release dates," Omega, Elsevier, vol. 78(C), pages 21-38.
    2. Wang, Ling & Sun, Lin-Yan & Sun, Lin-Hui & Wang, Ji-Bo, 2010. "On three-machine flow shop scheduling with deteriorating jobs," International Journal of Production Economics, Elsevier, vol. 125(1), pages 185-189, May.
    3. Chung, Chia-Shin & Flynn, James & Kirca, Omer, 2006. "A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems," European Journal of Operational Research, Elsevier, vol. 174(1), pages 1-10, October.
    4. Gajpal, Yuvraj & Rajendran, Chandrasekharan, 2006. "An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops," International Journal of Production Economics, Elsevier, vol. 101(2), pages 259-272, June.
    5. Wang, Sheng-yao & Wang, Ling & Liu, Min & Xu, Ye, 2013. "An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem," International Journal of Production Economics, Elsevier, vol. 145(1), pages 387-396.
    6. Lee, Wen-Chiung & Wu, Chin-Chia, 2004. "Minimizing total completion time in a two-machine flowshop with a learning effect," International Journal of Production Economics, Elsevier, vol. 88(1), pages 85-93, March.
    7. He, Xuan & Pan, Quan-Ke & Gao, Liang & Neufeld, Janis S. & Gupta, Jatinder N.D., 2024. "Historical information based iterated greedy algorithm for distributed flowshop group scheduling problem with sequence-dependent setup times," Omega, Elsevier, vol. 123(C).
    8. Wu, Chin-Chia & Lee, Wen-Chiung, 2009. "A note on the total completion time problem in a permutation flowshop with a learning effect," European Journal of Operational Research, Elsevier, vol. 192(1), pages 343-347, January.
    9. N Madhushini & C Rajendran & Y Deepa, 2009. "Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted f," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(7), pages 991-1004, July.
    10. Mohamed Ali Rakrouki & Anis Kooli & Sabrine Chalghoumi & Talel Ladhari, 2020. "A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates," Operational Research, Springer, vol. 20(1), pages 21-35, March.
    11. Chia-Shin Chung & James Flynn & Walter Rom & Piotr Staliński, 2012. "A Genetic Algorithm to Minimize the Total Tardiness for M-Machine Permutation Flowshop Problems," Journal of Entrepreneurship, Management and Innovation, Fundacja Upowszechniająca Wiedzę i Naukę "Cognitione", vol. 8(2), pages 26-43.
    12. Ladhari, Talel & Rakrouki, Mohamed Ali, 2009. "Heuristics and lower bounds for minimizing the total completion time in a two-machine flowshop," International Journal of Production Economics, Elsevier, vol. 122(2), pages 678-691, December.

    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:joptap:v:156:y:2013:i:1:d:10.1007_s10957-012-0211-6. 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.