Description: [X, f] = L01p_e (c, A, b, N) with the following enumeration method for solving linear programming problems 0-1 min f = c ' * x, st A* x < = b, x is an integer of all components 0 or 1, where N represents the constraints Ax ≤ b in the equation of the first N, N = 0 can be omitted. Return result x is the optimal solution, f is the function value at the optimal solution.
To Search:
File list (Check if you may need any files):
L01p_e.m
Download