I have a large linear program that takes 10 seconds, which is too long. I'd like to limit it and get a solution that is feasible but not necessarily optimal.
For a mix-int problem, there's the parameter SolutionLimit. Is there something similar for LP? For example, the first vertex that the simplex algorithm finds.
Please sign in to leave a comment.