Question 1 10 Points Given the following problems: Select the correct statements only A The problem such as "A company has a delivery truck that needs to deliver goods between 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 Feasible Non-linear problems in operations research can always be optimized to find a global optimal solution ... x1 = My 1,000 - Xi = M (1 yi) D y = 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. max z =4x, +5x2 3x4 1 S.t. 4x, >x2 *, 2x32 *, 20, 1 [1,3] This problem is considered to be a non-linear