{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:20:58Z","timestamp":1750220458438,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T00:00:00Z","timestamp":1626566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Deutsche Forschungsgemeinschaft (DFG German Research Foundation)","award":["2236\/1"],"award-info":[{"award-number":["2236\/1"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,18]]},"DOI":"10.1145\/3452143.3465538","type":"proceedings-article","created":{"date-parts":[[2021,7,13]],"date-time":"2021-07-13T22:32:21Z","timestamp":1626215541000},"page":"313-320","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Extending the Fundamental Theorem of Linear Programming for Strict Inequalities"],"prefix":"10.1145","author":[{"given":"Jasper","family":"Nalbach","sequence":"first","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}]},{"given":"Erika","family":"\u00c1brah\u00e1m","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}]},{"given":"Gereon","family":"Kremer","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22110-1_14"},{"key":"e_1_3_2_1_2_1","unstructured":"Nikolaj Bj\u00f8rner and Anh-Dung Phan. 2014. \u03bdZ-Maximal Satisfaction with Z3. (2014). Symbolic Computation in Software Science."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20807-2_9"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24318-4_26"},{"volume-title":"Origins of the Simplex Method","author":"Dantzig George B","key":"e_1_3_2_1_5_1","unstructured":"George B Dantzig. 1990. Origins of the Simplex Method. Association for Computing Machinery, 141--151."},{"volume-title":"Linear Programming and Extensions","author":"Dantzig George B","key":"e_1_3_2_1_6_1","unstructured":"George B Dantzig. 1998. Linear Programming and Extensions. Princeton University Press."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38574-2_12"},{"key":"e_1_3_2_1_9_1","first-page":"255","article-title":"Certifying and Repairing Solutions to Large LPs, How good are LP-solvers?","volume":"3","author":"Dhiflaoui Marcel","year":"2003","unstructured":"Marcel Dhiflaoui, Stefan Funke, Carsten Kwappik, Kurt Mehlhorn, Michael Seel, Elmar Schomer, Ralph Schulte, and Dennis Weber. 2003. Certifying and Repairing Solutions to Large LPs, How good are LP-solvers?. In SODA, Vol. 3. 255--256.","journal-title":"SODA"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_11"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792235918"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1515\/crll.1902.124.1"},{"key":"e_1_3_2_1_14_1","unstructured":"Institute for Numerical Analysis (US). 1951. Problems for the Numerical Analysis of the Future. US Government Printing Office."},{"key":"e_1_3_2_1_15_1","volume-title":"Analyse des travaux de l'Acad\u00e9mie Royale des Sciences pendant l'ann\u00e9e","author":"Fourier Jean BJ","year":"1824","unstructured":"Jean BJ Fourier. 1825. Analyse des travaux de l'Acad\u00e9mie Royale des Sciences pendant l'ann\u00e9e 1824. Partie math\u00e9matique (1825)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/3215177.3215182"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02284624"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-40970-2_35"},{"key":"e_1_3_2_1_19_1","volume-title":"Mathematical methods of organizing and planning production. Management science","author":"Kantorovich Leonid V","year":"1960","unstructured":"Leonid V Kantorovich. 1960. Mathematical methods of organizing and planning production. Management science, Vol. 6, 4 (1960), 366--422."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Jean-Louis Lassez and Ken McAloon. 1989. Independence of negative constraints. In Colloquium on Trees in Algebra and Programming. 19--27.","DOI":"10.1007\/3-540-50939-9_122"},{"volume-title":"Linear and Nonlinear Programming","author":"Luenberger David G","key":"e_1_3_2_1_22_1","unstructured":"David G Luenberger and Yinyu Ye. 1984. Linear and Nonlinear Programming. Springer."},{"key":"e_1_3_2_1_23_1","unstructured":"Theodore S Motzkin. 1936. Beitr\u00e4ge zur Theorie der linearen Ungleichungen. Azriel."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.18154\/RWTH-2021-04303"},{"volume-title":"Linear Algebra and Geometry","author":"Shafarevich Igor R","key":"e_1_3_2_1_25_1","unstructured":"Igor R Shafarevich and Alexey O Remizov. 2012. Linear Algebra and Geometry. Springer."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00348824"}],"event":{"name":"ISSAC '21: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Virtual Event Russian Federation","acronym":"ISSAC '21"},"container-title":["Proceedings of the 2021 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3452143.3465538","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3452143.3465538","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:48:08Z","timestamp":1750193288000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3452143.3465538"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,18]]},"references-count":24,"alternative-id":["10.1145\/3452143.3465538","10.1145\/3452143"],"URL":"https:\/\/doi.org\/10.1145\/3452143.3465538","relation":{},"subject":[],"published":{"date-parts":[[2021,7,18]]},"assertion":[{"value":"2021-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}