z-logo
open-access-imgOpen Access
Optimization of planned solutions based on network models for large-scale problems
Author(s) -
Yu N Kondrashov,
A. A. Ermakov
Publication year - 2020
Publication title -
iop conference series materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/862/5/052074
Subject(s) - mathematical optimization , computer science , linear programming , scale (ratio) , plan (archaeology) , network planning and design , function (biology) , optimization problem , mathematics , computer network , physics , archaeology , quantum mechanics , evolutionary biology , biology , history
This article covers the development of the project planning algorithm based on network models for solving large-scale problems. The planning algorithm which brings the problem of plan optimization based on a network model down to a general problem of non-linear programming with the possibility of flexible formation of the goal function and constraints is completed by the iterative aggregation method for problems of non-linear programming which allows increasing the efficiency of solving large-scale problems.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom