Question 2 of 2.1 of the Optimization portion of the Text/TimeSeries/Experiments/Optimization course says the default algorithm for linear programming is dual simplex, while the "Three-Dimensional Example" video states that the default in PROC OPTMODEL is primal simplex. Which is it? Am I conflating two different parts of the program, or is this contradictory?
It might depend. I believe if you run an example, it should tell you which method it is using.
https://support.sas.com/documentation/onlinedoc/or/143/optmodel.pdf
MODEL chooses a solver that depends on the problem type. Table 5.8 lists the default solver for each problem type.1
Table 5.8 Default Solvers and Algorithms in PROC OPTMODEL
Problem Solver Algorithm Constraint programming CLP Constraint propagation and backtracking search
Linear programming LP Dual simplex
Mixed integer linear programming MILP Branch-and-cut
General nonlinear programming NLP Interior point NLP
Quadratic programming QP Interior point QP
I can't verify t anything about the procedure, test or documentation. All I can do is point you to the documentation. Perhaps someone more knowledgeable will look at your question and respond.
Don't miss out on SAS Innovate - Register now for the FREE Livestream!
Can't make it to Vegas? No problem! Watch our general sessions LIVE or on-demand starting April 17th. Hear from SAS execs, best-selling author Adam Grant, Hot Ones host Sean Evans, top tech journalist Kara Swisher, AI expert Cassie Kozyrkov, and the mind-blowing dance crew iLuminate! Plus, get access to over 20 breakout sessions.
Learn how to run multiple linear regression models with and without interactions, presented by SAS user Alex Chaplin.
Find more tutorials on the SAS Users YouTube channel.