{"action":"created","issue":{"url":"https://api.github.com/repos/snopt/snopt-interface/issues/24","repository_url":"https://api.github.com/repos/snopt/snopt-interface","labels_url":"https://api.github.com/repos/snopt/snopt-interface/issues/24/labels{/name}","comments_url":"https://api.github.com/repos/snopt/snopt-interface/issues/24/comments","events_url":"https://api.github.com/repos/snopt/snopt-interface/issues/24/events","html_url":"https://github.com/snopt/snopt-interface/issues/24","id":361082091,"node_id":"MDU6SXNzdWUzNjEwODIwOTE=","number":24,"title":"Snopt 7.4 thinks an unbounded LP is bounded","user":{"login":"hongkai-dai","id":6314000,"node_id":"MDQ6VXNlcjYzMTQwMDA=","avatar_url":"https://avatars2.githubusercontent.com/u/6314000?v=4","gravatar_id":"","url":"https://api.github.com/users/hongkai-dai","html_url":"https://github.com/hongkai-dai","followers_url":"https://api.github.com/users/hongkai-dai/followers","following_url":"https://api.github.com/users/hongkai-dai/following{/other_user}","gists_url":"https://api.github.com/users/hongkai-dai/gists{/gist_id}","starred_url":"https://api.github.com/users/hongkai-dai/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/hongkai-dai/subscriptions","organizations_url":"https://api.github.com/users/hongkai-dai/orgs","repos_url":"https://api.github.com/users/hongkai-dai/repos","events_url":"https://api.github.com/users/hongkai-dai/events{/privacy}","received_events_url":"https://api.github.com/users/hongkai-dai/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":1,"created_at":"2018-09-17T23:34:09Z","updated_at":"2018-09-18T00:29:08Z","closed_at":null,"author_association":"NONE","body":"I tried to solve a simple LP\r\n```\r\nmin -x(0) - x(1)\r\ns.t 2x(0) + x(1) >= 4\r\n    x(0) >= 0\r\n    x(1) >= 2\r\n```\r\nThis problem should be unbounded, but when I use the C interface of snopt 7.4-1.4, it thinks the solution (0, 4) is optimal.\r\n\r\nThe test code and snopt output log is in \r\n[unbounded_lp.zip](https://github.com/snopt/snopt-interface/files/2390595/unbounded_lp.zip)\r\n\r\nWhen I use Snopt 7.4-1.2 with f2c interface, the solver detects unboundedness.\r\n\r\nIs there something wrong when I set up the problem in my `problem.c` file?\r\n"},"comment":{"url":"https://api.github.com/repos/snopt/snopt-interface/issues/comments/422213837","html_url":"https://github.com/snopt/snopt-interface/issues/24#issuecomment-422213837","issue_url":"https://api.github.com/repos/snopt/snopt-interface/issues/24","id":422213837,"node_id":"MDEyOklzc3VlQ29tbWVudDQyMjIxMzgzNw==","user":{"login":"gnowzil","id":9013998,"node_id":"MDQ6VXNlcjkwMTM5OTg=","avatar_url":"https://avatars0.githubusercontent.com/u/9013998?v=4","gravatar_id":"","url":"https://api.github.com/users/gnowzil","html_url":"https://github.com/gnowzil","followers_url":"https://api.github.com/users/gnowzil/followers","following_url":"https://api.github.com/users/gnowzil/following{/other_user}","gists_url":"https://api.github.com/users/gnowzil/gists{/gist_id}","starred_url":"https://api.github.com/users/gnowzil/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/gnowzil/subscriptions","organizations_url":"https://api.github.com/users/gnowzil/orgs","repos_url":"https://api.github.com/users/gnowzil/repos","events_url":"https://api.github.com/users/gnowzil/events{/privacy}","received_events_url":"https://api.github.com/users/gnowzil/received_events","type":"User","site_admin":false},"created_at":"2018-09-18T00:29:08Z","updated_at":"2018-09-18T00:29:08Z","author_association":"CONTRIBUTOR","body":"Which version of the C interface are you using?  And if it's not the latest, can you please use the latest?  The problem was unbounded when I coded it up in Fortran and C.  I can't figure out which version of the C interface has `solveC` like in your example so I can't run yours directly."}}
{"actor":{"display_login":"gnowzil"}}