-
Notifications
You must be signed in to change notification settings - Fork 84
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Feasible problem returns infeasible; inconsistent results #15
Comments
Attachment ch108-prob1-mps.zip by ltaylor created at 2007-11-17 03:29:27 Zip of MPS file of problem, plus basis file believed to be correct solution |
Comment by @jpfasano created at 2007-11-17 11:47:41 LAT states:
This is not what happens for me. 'primals' reports the problem as infeasible:
I used the current trunk version of Clp built with the Microsoft V8 compiler solution file. |
Comment by @jpfasano created at 2007-11-17 12:33:07 The latest trunk Clp code on Linux report the problem as infeasible when solved with 'primals' or 'duals'. |
Comment by ladanyi created at 2008-02-11 04:08:13 Same things happen for me as for JP: 1.6.0, stable/1.6, trunk all return infeasible both with primals and duals. I compiled with VC++ Express. cplex also determines the problem to be infeasible. The two solvers agree, so I doubt that the problem would be feasible, i.e., the basis supplied in the zip file could be an optimal basis. For now I close the ticket. LAT, feel free to reopen the ticket if you still think that there is problem. --Laci |
Comment by ladanyi created at 2008-02-11 04:08:13 Resolution: worksforme |
Issue created by migration from Trac.
Original creator: ltaylor
Original creation time: 2007-11-17 03:27:24
Assignee: somebody
Version:
This is an MPS file generated by COINMP.dll interface, after loading it by API calls. Under COINOptimizeProblem, it returns problem infeasible.
I have also tested it with: (1) windows binary clp.exe, several versions; (2) locally compiled MS Visual studio 2005 project in debug mode, with project files in synch with the latest (Nov. 16. 2007) versions, and several previous versions. Revision 1137.
However, if I load the same file and use command 'primals', clp.exe reports that the problem is feasible. As I know from solving it previously, the correct solution has an objective of 4.87.
Notice that this was the clp.exe of the binary download clp-1.3.3-win32-msvc8.
Even for this earlier version, it does not get the correct answer if you type 'duals'.
What is even weirder is that if you do the same problem in clp.exe twice in a row (e.g., duals followed by duals, or other combinations), I get different answers. Something is not clearing out between optimizations.
Also, although when it gets the right answer, 4.87, it is not reported correctly in the same line as the "optimal" report.
LAT
The text was updated successfully, but these errors were encountered: