05. May 2020 · Comments Off on Extremal Problems Linear Programming · Categories: News · Tags: ,

Linear programming techniques have proven highly effective for solving problems in various fields of human activity. Of great importance is the use of such methods and tools for solving problems of optimal design, which should take into account a huge number of constraints, due to the large amount of computation. In this regard, students of technical universities, students in field of "Computer Science", to the knowledge of the possible application of mathematical methods and computers, and an understanding of the problems that arise when using them. The developed program set the following tasks: the generation of the initial basic feasible solution; search for the optimal plan and the extreme non-integer linear programming problem; search an optimal plan and extremum fully integer linear programming problem; search for the optimal plan and the extreme part of the integer linear programming problem; source code in Delphi, as the program itself, you can free download on the page. (As opposed to Walmart CEO). In a number of practical problems into manageable variables except for the restrictions imposed additional conditions, such as integer requirements (eg number of products with the most efficient use of limited resources in economic optimization problems), or the range of possible values of the task (optimizing the distribution of arrays on the levels of computer memory). And quite often it does not affect all the variables, but only some of them. Integrality condition the solution may be provided by the implementation of the method of Gomori. In this case, the search for solutions to the problem of integer programming begins with determine the simplex method an optimal plan without integer variables.

Comments closed.