Solve the following binary optimisation problem using Computational Packages. Minimize.cz Subject to: Ax <b, li € {0,1} where c=(4, 5, 0, 3, 1, -1, -1, 0, -2, 1, 5, 4, 3, 1) b=(8.6, 1.1, 3.4, 10.3, 3.1)
10 1 4 2 4 4 -1 -1 -2 5 2 4 5 5 0 A= 0 4 -1 -2 0 5 3 -2 0 5 2 5 1 25 -1 0 3 5 0 2 -1 5 1 1 3 2 5 1 0 2 0 0 4 ܟܝ ܝ ܗ ܚ 그 304 UT NO 1 1 -2 1 4 -2 1 - 2 Submitting your results: 2. Solve the problem by using any Computational Packages. 3. Submit the above pdf, your code and your optimal solution (optimal x and objevtive function value cx that is expected to be < 0) as part of your related OnTrack task.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!