Hi, We trying to solve the next optimization problem? We have: • Pij, i=1÷3, j=1÷30, Pij are positive • Bi, i=1÷3, integer positive We trying to solve the next optimization problem? Constraints: • For each j =1÷30, Sum (by index of i=1÷3)Xij=1 • For each i =1÷3, Sum by index of (j=1÷3o)Xij≤Bi Objective: Optimize: • Maximize ( Sum (by index of i=1÷3) Sum (by index of j=1÷30) Pij *Xij) Is it possible to solve the problem be the lpsolve or milpsolve subroutine? Is there another predefined subroutine in SAS/IML which can be used to solve this problem? We haven’t the SAS/OR. Thank you in advance, Boriana