I'm running  proc quantreg with 2 independent variables over 12555029 cases.  The error for insufficient memory is appear: ERROR: Unable to allocate sufficient memory. At least 1177035K bytes were requested, but only 786430K were available. You must either increase the amount of memory available, or approach the problem differently. I have 8GB RAM.  I check memsize and receive the next: Group=MEMORY SORTSIZE=268435456 Specifies the amount of memory that is available to the SORT procedure. SUMSIZE=0 Specifies a limit on the amount of memory that is available for data summarization procedures when class variables are active. MAXMEMQUERY=0 Specifies the maximum amount of memory that is allocated for procedures. MEMBLKSZ=16777216 Specifies the memory block size for Windows memory-based libraries. MEMMAXSZ=2147483648 Specifies the maximum amount of memory to allocate for using memory-based libraries. LOADMEMSIZE=0 Specifies a suggested amount of memory that is needed for executable programs loaded by SAS. MEMSIZE=4294967295 Specifies the limit on the amount of virtual memory that can be used during a SAS session. REALMEMSIZE=0 Specifies the amount of real memory SAS can expect to allocate. The option  sasv9.cfg in sas is 6GB. But the same error appear with different sises there. Do you know that if I increase my RAM the problem will be solved.   ... View more

Can I estimate the marginal contribution of each variable in logistic regression by Standardized Estimate, received in stb option? Can I calculate marginal contribution of variables by other options or formula? ... View more

Does the PMT function included in the SAS Analytics Pro? I receive an error when use in data step: ERROR 68-185: The function PMT is unknown, or cannot be accessed ... View more

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 positiveConstraints: The searching result is matrix of 3 x 30 of binary values Xij with next conditions: 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 there another predefined subroutine in SAS/IML which can be used to solve this problem? We haven’t the SAS/OR. The suggested solution from Rick_SAS was to convert this to linear optimization programing. You can see here the solution. Linear optimization in SAS/IML In real situation we for j index we have 30000, not only 30. The matrix became too large. It is not possible to solve it by SAS/IML. The limitation there is 200 constraints, which is too few. We haven’t SAS/OR yet. My question concerns the limitation of constraints and the size of matrix in SAS/OR? Is it possible to work with matrix size of 90000 x 30000. How many constraints there can have? Is it possible to solve this task with another procedure, not with linear programing in SAS/OR? Thanks, Boriana ... View more