APPROXIMATION ALGORITHM TAKING INTO ACCOUNT TECHNOLOGICAL AND REGIME OF RESTRICTIONS IN THE PROBLEM OF PARAMETRIC OPTIMIZATION OF HYDRAULIC SYSTEMS

2016 ◽  
Vol 9 (1) ◽  
pp. 24-29
Author(s):  
Мезенцев ◽  
A. Mezentsev ◽  
Сазонова ◽  
Svetlana Sazonova

The peculiarities of construction and implementation of approximation algorithm taking into account technological and regime of restrictions in the problem of parametric optimization of hydraulic systems.

2016 ◽  
Vol 9 (1) ◽  
pp. 29-33
Author(s):  
Мезенцев ◽  
A. Mezentsev ◽  
Сазонова ◽  
Svetlana Sazonova

The results of computational experiments for testing the approximation algorithm of parametric optimization of hydraulic systems. The object of investigation was adopted SIS theme of gas supply of low pressure residential neighborhood.


2016 ◽  
Vol 8 (4) ◽  
pp. 64-68
Author(s):  
Сазонова ◽  
Svetlana Sazonova

The results of computational experiments to assess the impact of parametric optimization of hydraulic systems on economic performance. The object of the research system of low-pressure gas supply of a residential district was chosen. The purpose of research is to optimize the economic parameters for the number of backup sites, sufficient to provide the desired level of reliability and security in the operation of the systems studied.


1997 ◽  
Vol 11 (4) ◽  
pp. 509-522 ◽  
Author(s):  
Shalabh Bhatnagar ◽  
Vivek S. Borkar

A two–time scale stochastic approximation algorithm is proposed for simulation-based parametric optimization of hidden Markov models, as an alternative to the traditional approaches to “infinitesimal perturbation analysis.” Its convergence is analyzed, and a queueing example is presented.


2016 ◽  
Vol 8 (3) ◽  
pp. 77-81
Author(s):  
Сазонова ◽  
Svetlana Sazonova ◽  
Мезенцев ◽  
A. Mezentsev

For the formation of the unloaded reserve functioning of hydraulic systems can be applied approximation algorithm. Thus it is necessary to ensure the consistency of the system of equations consists in the fact that the number of manageable nodes in the parameters of limited consumption must match the number of bypass lines, the diameters of which are to be determined. Once movement of these lines is not involved in the formalization of ass-Chi, so their rational configuration can be obtained on the basis of the study of a priori given set of options.


Author(s):  
Cristina Bazgan ◽  
Arne Herzel ◽  
Stefan Ruzika ◽  
Clemens Thielen ◽  
Daniel Vanderpooten

Abstract In a (linear) parametric optimization problem, the objective value of each feasible solution is an affine function of a real-valued parameter and one is interested in computing a solution for each possible value of the parameter. For many important parametric optimization problems including the parametric versions of the shortest path problem, the assignment problem, and the minimum cost flow problem, however, the piecewise linear function mapping the parameter to the optimal objective value of the corresponding non-parametric instance (the optimal value function) can have super-polynomially many breakpoints (points of slope change). This implies that any optimal algorithm for such a problem must output a super-polynomial number of solutions. We provide a method for lifting approximation algorithms for non-parametric optimization problems to their parametric counterparts that is applicable to a general class of parametric optimization problems. The approximation guarantee achieved by this method for a parametric problem is arbitrarily close to the approximation guarantee of the algorithm for the corresponding non-parametric problem. It outputs polynomially many solutions and has polynomial running time if the non-parametric algorithm has polynomial running time. In the case that the non-parametric problem can be solved exactly in polynomial time or that an FPTAS is available, the method yields an FPTAS. In particular, under mild assumptions, we obtain the first parametric FPTAS for each of the specific problems mentioned above and a $$(3/2 + \varepsilon )$$ ( 3 / 2 + ε ) -approximation algorithm for the parametric metric traveling salesman problem. Moreover, we describe a post-processing procedure that, if the non-parametric problem can be solved exactly in polynomial time, further decreases the number of returned solutions such that the method outputs at most twice as many solutions as needed at minimum for achieving the desired approximation guarantee.


2016 ◽  
Vol 9 (1) ◽  
pp. 48-51
Author(s):  
Сазонова ◽  
Svetlana Sazonova

Problem definition of parametrical optimization of hydraulic systems is considered. The general problem of parametrical optimization for systems of water supply and gas supply is presented in the form of a problem of mathematical programming. As a result of the solution of the considered task optimum parameters of the studied systems have to be determined, the required levels of reliability and safety when functioning are ensured.


2016 ◽  
Vol 9 (1) ◽  
pp. 33-37
Author(s):  
Мезенцев ◽  
A. Mezentsev ◽  
Сазонова ◽  
Svetlana Sazonova

In the formation of the local correction algorithms diameter hydraulic systems. The choice of the group sites, pipe diameters of which are subject to change. We consider two algorithms for adjusting the diameter, realized on the basis of the developed software package. Solution of parametric optimization provides the required level of reliability and safety of hydraulic systems.


Sign in / Sign up

Export Citation Format

Share Document