A method for finding an optimal solution of mixed integer programming problems with one constraint is proposed. Initially, this method lessens the number of variables and the interval of their change; then, for the resulting problem one derives recurrent relations of dynamic programming that are used for computing. dynamic programming is a method for solving a complex problem by breaking it down into a collection of simpler subproblems, solving each of those subproblems just once, and storing their solutions. Using a matrix for information storage, we can solve problems of a sufficiently large dimension. The computational experiments demonstrate that the method in question is highly efficient. In this paper shows study about Knapsack problem.
No. of Downloads :