Given the following problems: Select the correct statements only The problem such as "A company has a delivery truck that needs to deliver goods between a A number of customers then come back to the starting point" can be modelled as Capital Budgeting problem B Integer programming problems are easier to solve than binary programming problems max 2 = 4x, + 5x2 3x S.. 4*, 2x2 *, 20,1 [1.31 This problem is considered to be a non- linear problem D Feasible Non-linear problems in operations research can always be optimized to find a global optimal solution max z=4x, +5x2 - 3x4 z S.r. 4x, x2 * 20,1 [1,3) This problem is considered to be a non-linear problem Feasible Non-linear problems in operations research can always be optimized to find a global optimal solution . x = Miyi 1,000 - x1 = M (1 - y) Yi = 0 or 1 - This equation is used when solving the "Either-Or" Integer programming problems. It does not allow the value of M1 to be in the range of 1-999