Skip navigation

putin IS MURDERER

Please use this identifier to cite or link to this item: https://oldena.lpnu.ua/handle/ntb/46296
Title: Determination of approaches for project costs minimization with use of dual problems
Authors: Chernov, S.
Titov, S.
Chernova, L.
Kunanets, N.
Chernova, L.
Affiliation: Admiral Makarov National University of Shipbuilding
Lviv Polytechnic National University
Bibliographic description (Ukraine): Determination of approaches for project costs minimization with use of dual problems / S. Chernov, S. Titov, L. Chernova, N. Kunanets, L. Chernova // Econtechmod : scientific journal. — Lublin, 2019. — Vol 8. — No 4. — P. 61–68.
Bibliographic description (International): Determination of approaches for project costs minimization with use of dual problems / S. Chernov, S. Titov, L. Chernova, N. Kunanets, L. Chernova // Econtechmod : scientific journal. — Lublin, 2019. — Vol 8. — No 4. — P. 61–68.
Is part of: Econtechmod : scientific journal, 4 (8), 2019
Issue: 4
Volume: 8
Issue Date: 26-Jun-2019
Place of the edition/event: Lublin
Keywords: linear optimization
primal problem
dual problem
duality
objective function
constraint system
pairs of dual problems
Number of pages: 8
Page range: 61-68
Start page: 61
End page: 68
Abstract: For determining ways of company development, ensuring the growth of profit in manufacture and sales of certain products, it has been proposed to use an algorithm of constructing a problem being inverse to primaldual one, for minimization of the project costs. The primal and the inverse problems contribute to improving the efficiency of calculation when determining approaches for minimization of costs. This pair of problems is mutually conjugate. The proposed rigorous approach to obtaining the algorithm of constructing a dual problem is based on the following statement: a problem being inverse to a dual one is a primal (original) problem. The authors have proposed and rigorously proven the algorithm of a general approach to the construction of conjugate problem pairs. Formalization of the algorithm developed allows obtaining easily correct pairs of known dual problems. This permitted proposing and proving the truth of the algorithm of constructing a dual problem for the arbitrary form of a primal problem representation.
URI: https://ena.lpnu.ua/handle/ntb/46296
Copyright owner: © Copyright by Lviv Polytechnic National University 2019
© Copyright by University of Engineering and Economics in Rzeszów 2019
References (Ukraine): 1. Callahan K., Brooks L. 2004. Essentials of Strategic Project Management. John Wiley & Sons, Inc., Hoboken, NJ, USA.
2. Dinsmore P., Cabanis-Brewin J. 2014. The AMA Handbook of Project Management. Fourth Edition. Amacom Books, New York, NY, USA.
3. Grisham T. 2010. International Project Management: Leadership in Complex Environments. 1st Edition. John Wiley & Sons, Inc. Hoboken, NJ, USA.
4. A Guide to the Project Management Body of Knowledge. 2017. (PMBOK® Guide). Sixth Edition. Project Management Institute, Inc., Newtown Square, PA, USA.
5. Bushuev S. D., Bushuev D. A., Bushueva N. S., Kozyr B. Y. 2018. Information technologies for project management competences development on the basis of global trends // Information technologies and learning tools, Vol. 68, No. 6.
6. Danchenko E. B. 2011. A conceptual model of integrated management of deviations in the project // Project management in the development of society: Abstracts of The 8th International Conference. Kyiv, KNUBA, 68–70.
7. Friedmann O., Hansen T. and Zwick U. 2011. Subexponential lower bounds for randomized pivoting rules for the simplex algorithm, Proceedings of the 43rd annual ACM symposium on Theory of computing. New York, NY, USA. STOC’11, ACM, 283–292.
8. Friedmann O. 2011. A subexponential lower bound for zadeh’s pivoting rule for solving linear programs and games, Proceedings of the 15th international conference on Integer programming and combinatoral optimization. Berlin, Heidelberg. IPCO’11, Springer Verlag, 2011, 192–206.
9. Titov S. D., Chernova L. S. 2017. Higher and Applied Mathematics: Training Manual: In 2 Parts, Part 1. Kharkiv, Fakt, 336.
References (International): 1. Callahan K., Brooks L. 2004. Essentials of Strategic Project Management. John Wiley & Sons, Inc., Hoboken, NJ, USA.
2. Dinsmore P., Cabanis-Brewin J. 2014. The AMA Handbook of Project Management. Fourth Edition. Amacom Books, New York, NY, USA.
3. Grisham T. 2010. International Project Management: Leadership in Complex Environments. 1st Edition. John Wiley & Sons, Inc. Hoboken, NJ, USA.
4. A Guide to the Project Management Body of Knowledge. 2017. (PMBOK® Guide). Sixth Edition. Project Management Institute, Inc., Newtown Square, PA, USA.
5. Bushuev S. D., Bushuev D. A., Bushueva N. S., Kozyr B. Y. 2018. Information technologies for project management competences development on the basis of global trends, Information technologies and learning tools, Vol. 68, No. 6.
6. Danchenko E. B. 2011. A conceptual model of integrated management of deviations in the project, Project management in the development of society: Abstracts of The 8th International Conference. Kyiv, KNUBA, 68–70.
7. Friedmann O., Hansen T. and Zwick U. 2011. Subexponential lower bounds for randomized pivoting rules for the simplex algorithm, Proceedings of the 43rd annual ACM symposium on Theory of computing. New York, NY, USA. STOC’11, ACM, 283–292.
8. Friedmann O. 2011. A subexponential lower bound for zadeh’s pivoting rule for solving linear programs and games, Proceedings of the 15th international conference on Integer programming and combinatoral optimization. Berlin, Heidelberg. IPCO’11, Springer Verlag, 2011, 192–206.
9. Titov S. D., Chernova L. S. 2017. Higher and Applied Mathematics: Training Manual: In 2 Parts, Part 1. Kharkiv, Fakt, 336.
Content type: Article
Appears in Collections:Econtechmod. – 2019. – Vol. 8, No. 4

Files in This Item:
File Description SizeFormat 
2019v8n4_Chernov_S-Determination_of_approaches_61-68.pdf181.19 kBAdobe PDFView/Open
2019v8n4_Chernov_S-Determination_of_approaches_61-68__COVER.png436.94 kBimage/pngView/Open
Show full item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.