English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Successful project activities in the IT industry are determined by the extent of difficulty in the team formation and implementation of projects themselves. IT projects provide for fulfillment of a number of tasks that are interrelated. In formation of such a project, account should be taken of certain factors necessary for its successful implementation, determination of the technology for fulfilling intermediate tasks: consecutive or parallel, and for setting the priorities. This approach requires detailed calculation and scientifically grounded decisions. The authors have proposed an original approach to solving discrete optimization problems related to fundamental calculation difficulties in the process of an IT project formation. The known methods of exact or approximate solution of such problems are studied with account taken of their belonging to so-called Pand NP-class problems (the polynomial and the exponential solution algorithms). The modern combinatory and heuristic methods for solving practical discrete optimization problems require development of algorithms that allow obtaining approximate solution with guaranteed estimate of deviation from the optimum. Simplification algorithms provide an efficient method of searching for an optimization problem solution. Should a multidimensional process be projected onto the twodimensional surface, this will enable graphical visualization of sets of the problem solutions. This research provides a way for simplifying the combinatory solution of a discrete optimization problem. It is based on decomposition of the system that represents the system constraining a multidimensional output problem to the two-dimensional coordinate plane. Such method allows obtaining a simple system of graphical solutions of a complicated linear discrete optimization problem. From the practical point of view, the proposed method allows reducing the calculation complicacy of optimization problems belonging to this class when the IT project solutions are complicated. The approach proposed can be applied in using the obtained research result for assuring the possibility to improve the class of problems presented by linear equation systems. The automation of calculations in the Maple environment provides the basis for further development and improvement of such algorithms, and for using in teaching a number of disciplines in education programs on IT project management aimed at Master’s degree.

The Maple ® symbolic mathematics system in the method of projections for discrete optimization problems