Construction of the fractional-nonlinear optimization method

Authors

DOI:

https://doi.org/10.15587/1729-4061.2019.174079

Keywords:

fractional nonlinear function optimization, linear constraints, single-step procedure, exact solution

Abstract

A method for solving the fractional nonlinear optimization problem has been proposed. It is shown that numerous inventory management tasks, on the rational allocation of limited resources, on finding the optimal paths in a graph, on the rational organization of transportation, on control over dynamical systems, as well as other tasks, are reduced exactly to such a problem in cases when the source data of a problem are described in terms of a probability theory or fuzzy math. We have analyzed known methods for solving the fractional nonlinear optimization problems. The most efficient among them is based on the iterative procedure that sequentially improves the original solution to a problem. In this case, every step involves solving the problem of mathematical programming. The method converges if the region of permissible solutions is compact. The obvious disadvantage of the method is the uncontrolled rate of convergence. The current paper has proposed a method to solve the problem, whose concept echoes the known method of fractional-linear optimization. The proposed technique transforms an original problem with a fractional-rational criterion to the typical problem of mathematical programming. The main advantage of the method, as well its difference from known ones, is the fact that the method is implemented using a single-step procedure for obtaining a solution. In this case, the dimensionality of a problem is not a limiting factor. The requirements to a mathematical model of the problem, which narrow the region of possible applications of the devised procedure, imply:

1) the components of the objective function must be separable functions;

2) the indicators for the power of all nonlinear terms of component functions should be the same.

Another important advantage of the method is the possibility of using it to solve the problem on unconditional and conditional optimization. The examples have been considered.

Author Biographies

Lev Raskin, National Technical University «Kharkiv Polytechnic Institute» Kyrpychova str., 2, Kharkiv, Ukraine, 61002

Doctor of Technical Sciences, Professor, Head of Department

Department of Distributed Information Systems and Cloud Technologies

Oksana Sira, National Technical University «Kharkiv Polytechnic Institute» Kyrpychova str., 2, Kharkiv, Ukraine, 61002

Doctor of Technical Sciences, Professor

Department of Distributed Information Systems and Cloud Technologies

References

  1. Yudin, D. B. (1974). Matematicheskie metody upravleniya v usloviyah nepolnoy informatsii. Zadachi i metody stohasticheskogo programmirovaniya. Moscow: Sovetskoe radio, 392.
  2. Bazaraa, M. S., Shetty, C. M. (1979). Nonlinear Programming: Theory and Algorithms. Wiley, 312.
  3. Larichev, O. I. (2002). Teoriya i metody prinyatiya resheniy. Moscow: Logos, 392.
  4. Karmanov, V. G. (1980). Matematicheskoe programmirovanie. Moscow, 256.
  5. Himmelblau, D. (1972). Applied Nonlinear Programming. New York: McGraw-Hill, 498.
  6. Zangwill, W. I. (1969). Nonlinear Programming: A Unified Approach. Prentice-Hall, 356.
  7. Rekleytis, G., Reyvindran, A., Regsdel, K. (1989). Optimizatsiya v tekhnike. Moscow: MIR, 349.
  8. Zuhovitskiy, S. I., Avdeeva, L. I. (1967). Lineynoe i vypukloe programmirovanie. Moscow: «Nauka», 460.
  9. Malaguti, E., Monaci, M., Paronuzzi, P., Pferschy, U. (2019). Integer optimization with penalized fractional values: The Knapsack case. European Journal of Operational Research, 273 (3), 874–888. doi: https://doi.org/10.1016/j.ejor.2018.09.020
  10. Yue, D., You, F. (2014). Reformulation-linearization Method for Global Optimization of Mixed Integer Linear Fractional Programming Problems with Application on Sustainable Batch Scheduling. 24th European Symposium on Computer Aided Process Engineering, 949–954. doi: https://doi.org/10.1016/b978-0-444-63456-6.50159-9
  11. Borza, M., Rambely, A. S., Saraj, M. (2012). Solving Linear Fractional Programming Problems with Interval Coefficients in the Objective Function. A New Approach. Applied Mathematical Sciences, 6 (69), 3443–3452.
  12. Khalifa, H. (2018). On Solutions of Linear Fractional Programming Problems with Rough-interval Coefficients in The Objective Function. The Journal of Fuzzy Mathematics, 26 (2), 415–422.
  13. Das, S. K., Mandal, T., Edalatpanah, S. A. (2017). A new approach for solving fully fuzzy linear fractional programming problems using the multi-objective linear programming. RAIRO - Operations Research, 51 (1), 285–297. doi: https://doi.org/10.1051/ro/2016022
  14. Deb, M. (2018). A Study of Fully Fuzzy Linear Fractional Programming Problems by Signed Distance Ranking Technique. Advances in Data Mining and Database Management, 73–115. doi: https://doi.org/10.4018/978-1-5225-5091-4.ch004
  15. Arya, R., Singh, P., Bhati, D. (2018). A fuzzy based branch and bound approach for multi-objective linear fractional (MOLF) optimization problems. Journal of Computational Science, 24, 54–64. doi: https://doi.org/10.1016/j.jocs.2017.12.011
  16. Arya, R., Singh, P. (2019). Fuzzy efficient iterative method for multi-objective linear fractional programming problems. Mathematics and Computers in Simulation, 160, 39–54. doi: https://doi.org/10.1016/j.matcom.2018.11.013
  17. Raskin, L. G. (1976). Analiz slozhnyh sistem i elementy teorii upravleniya. Moscow: Sovetskoe radio, 344.
  18. Wolf, H. (1986). Solving special nonlinear fractional programming problems via parametric linear programming. European Journal of Operational Research, 23 (3), 396–400. doi: https://doi.org/10.1016/0377-2217(86)90305-x
  19. Saxena, P., Jain, R. (2017). Duality for a nonlinear fractional programming under fuzzy environment with parabolic concave membership functions. International Journal of ADVANCED AND APPLIED SCIENCES, 4 (1), 131–136. doi: https://doi.org/10.21833/ijaas.2017.01.019
  20. Jeflea, A. (2003). A parametric study for solving nonlinear fractional problems. An. St. Univ. Ovidius Constanta, 11 (2), 87–92.
  21. Bhurjee, A. K., Panda, G. (2013). Nonlinear fractional programming problem with inexact parameter. Journal of Applied Mathematics & Informatics, 31 (5_6), 853–867. doi: https://doi.org/10.14317/jami.2013.853
  22. Zadeh, L. A. (1965). Fuzzy sets. Information and Control, 8 (3), 338–353. doi: https://doi.org/10.1016/s0019-9958(65)90241-x
  23. Pawlak, Z. (1985). Rough sets and fuzzy sets. Fuzzy Sets and Systems, 17 (1), 99–102. doi: https://doi.org/10.1016/s0165-0114(85)80029-4
  24. Pawlak, Z. (1991). Rough Sets: Theoretical Aspects of Reasoning about Data. Dordrecht: Kluwer Academic Publisher, 284. doi: https://doi.org/10.1007/978-94-011-3534-4
  25. Raskin, L., Sira, O. (2016). Method of solving fuzzy problems of mathematical programming. Eastern-European Journal of Enterprise Technologies, 5 (4 (83)), 23–28. doi: https://doi.org/10.15587/1729-4061.2016.81292
  26. Raskin, L., Sira, O. (2016). Fuzzy models of rough mathematics. Eastern-European Journal of Enterprise Technologies, 6 (4 (84)), 53–60. doi: https://doi.org/10.15587/1729-4061.2016.86739
  27. Raskin, L., Sira, O., Ivanchykhin, Y. (2017). Models and methods of regression analysis under conditions of fuzzy initial data. Eastern-European Journal of Enterprise Technologies, 4 (4 (88)), 12–19. doi: https://doi.org/10.15587/1729-4061.2017.107536

Downloads

Published

2019-07-24

How to Cite

Raskin, L., & Sira, O. (2019). Construction of the fractional-nonlinear optimization method. Eastern-European Journal of Enterprise Technologies, 4(4 (100), 37–43. https://doi.org/10.15587/1729-4061.2019.174079

Issue

Vol. 4 No. 4 (100) (2019): Mathematics and Cybernetics - applied aspects

Section

Mathematics and Cybernetics - applied aspects

License

Copyright (c) 2019 Lev Raskin, Oksana Sira

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.

A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.