Zorkaltsev V.I. Entering into the Domain of Feasible Solutions Using Interior Point Method // Automation and Remote Control. Vol.80. No.2. 2019. P.348-361. DOI: 10.1134/S0005117919020127 The interior point algorithm for a linear programming problem is considered. The algorithm consists of two stages. At the first stage, we enter into the domain of feasible solutions for given constraints. The second stage lies in optimization over the feasible domain. Entering into the ...
Теги: interior point method , linear programming , automation , control engineering , feasible solution , interior point algorithm , interior-point method , linear programming problem , nondegenerate... and the other can take only discrete (integer) values. An effective method is developed to solve a thermal power plant optimization problem with continuous and discrete parameters. The method suggests an iterative procedure for solving continuous nonlinear programming problems and discrete-continuous linear programming problems. For each iteration, we add new constraints obtained by linearizing nonlinear inequality constraints and the objective function of the initial problem to the system of inequality ...
Теги: discrete-continuous nonlinear optimization , heat and power plants , mathematical simulation , combined cycle power plants , constraint theory , integer programming , iterative methods , linear programming , nonlinear programming , thermoelectric power plants , wasZorkaltsev V.I., Mokryi I.V. Interior Point Algorithms in Linear Optimization // Journal of Applied and Industrial Mathematics. Vol.12. No.1. 2018. P.191-199. DOI: 10.1134/S1990478918010179 This is a survey of the results concerning the development and study of the interior point algorithms. Some families of the direct and dual algorithms are considered. These algorithms entering the domain of feasible solutions take into account the objective function, which makes it possible to obtain the first...
Теги: central path , interior point method , linear programming , relative interior , energy engineering , interior point algorithm , interior-point method , linear optimization , objective functions , optimal solutions , polynomial optimization , optimizatioKhamisov O.O., Stennikov V.A. Interior point and newton methods in solving high dimensional flow distribution problems for pipe networks // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol.10556 LNCS. 2017. P.139-149. ISBN (print): 9783319694030. DOI: 10.1007/978-3-319-69404-7_10 In this paper optimal flow distribution problem in pipe network is considered. The investigated problem is a convex sparse optimization...
Теги: convex optimization , interior point method , large-scale optimization , newton method , pipe network , sparse matrix , constraint theory , linear programming , newton-raphson method , optimization , quadratic programming , approximate solution , inequality constrain... the Memory of V.F. Demyanov), CNSA 2017 - Proceedings. 2017. ISBN (print): 9 781 509 062 607. DOI: 10.1109/CNSA.2017.7974038 The results of development, theoretical justification and experimental research of interior point algorithms for solving linear programming problems are presented in the article. © 2017 IEEE. нет
Теги: experimental research , interior point algorithm , interior-point method , linear programming problem , linear programmingZorkaltsev V.I. Search for feasible solutions by interior point algorithms // Numerical Analysis and Applications. Vol.9. No.3. 2016. P.191-206. DOI: 10.1134/S1995423916030022 A family of interior point algorithms for linear programming problems is considered. In these algorithms, entering the feasible solution region of the original problem is presented as an optimization process of an extended problem. This extension is performed by adding a new variable. The main ...
Теги: linear programming , optimization , consistent constraint , feasible regions , feasible solution , interior point , interior point algorithm , linear programming problem , non-degeneracy , algorithmsZorkaltsev V.I., Perzhabinsky S.M., Stetsyuk P.I. Using the Interior Point Method to Find Normal Solutions to a System of Linear Algebraic Equations with Bilateral Constraints on Variables* // Cybernetics and Systems Analysis. Vol.51. No.6. 2015. P.896-904. DOI: 10.1007/s10559-015-9782-1 The authors consider primal interior point algorithms to find normal solutions to systems of linear equations with bilateral constraints on variables. Analyzing this problem and the methods of its solution is important...
Теги: algorithms , computation theory , computational efficiency , linear algebra , linear equations , linear programming , problem solving , bilateral constraints , computational algorithm , experimental analysis
