THE DUAL PROBLEM CORRESPONDING TO THE BOOLEAN PROGRAMMING PROBLEM AND ITS LAGRANGIAN-TYPE APPROXIMATE SOLUTION
Scientific works/Elmi eserler · 22.07.2026 · 483
DOI: 10.58225/mpmma.2026.483 ↗Kurz gefasst
Fachartikel in der Zeitschrift Scientific works/Elmi eserler, online erschienen am 22.06.2026. Verfasst von Knyaz Mamedov und 1 weiteren Autor:innen. Die Arbeit nennt 24 Literaturangaben.
Abstract (Originalsprache)
In this work, an approximate solution method for the Boolean programming problem has been developed. For this purpose, a certain linear programming problem is constructed, and the corresponding dual problem is considered. By making specific modifications to the obtained problem, it is transformed into a Lagrangian problem, and an appropriate Lagrangian function is formulated. Certain properties of this function are proved, and it is shown that the function possesses a unique minimum value. Therefore, an algorithm has been developed for minimizing the constructed Lagrangiantype function. The main feature of this algorithm is that it provides not only the minimum value of the function, but also simultaneously yields an approximate solution to the considered Boolean programming problem.
Zitieren
APA
Mamedov, K., & Niyazova, R. (2026). THE DUAL PROBLEM CORRESPONDING TO THE BOOLEAN PROGRAMMING PROBLEM AND ITS LAGRANGIAN-TYPE APPROXIMATE SOLUTION. Scientific works/Elmi eserler, 483. https://doi.org/10.58225/mpmma.2026.483
Vancouver
Mamedov K, Niyazova R. THE DUAL PROBLEM CORRESPONDING TO THE BOOLEAN PROGRAMMING PROBLEM AND ITS LAGRANGIAN-TYPE APPROXIMATE SOLUTION. Scientific works/Elmi eserler. 2026:483. doi:10.58225/mpmma.2026.483
BibTeX
@article{Mamedov2026,
author = {Mamedov, Knyaz and Niyazova, Rayiha},
title = {THE DUAL PROBLEM CORRESPONDING TO THE BOOLEAN PROGRAMMING PROBLEM AND ITS LAGRANGIAN-TYPE APPROXIMATE SOLUTION},
journal = {Scientific works/Elmi eserler},
year = {2026},
pages = {483},
doi = {10.58225/mpmma.2026.483}
}
EUVIMED