{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:14:21Z","timestamp":1742948061859,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030628666"},{"type":"electronic","value":"9783030628673"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-62867-3_7","type":"book-chapter","created":{"date-parts":[[2020,11,5]],"date-time":"2020-11-05T08:05:11Z","timestamp":1604563511000},"page":"86-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Theorems of Alternative and Optimization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6094-7808","authenticated-orcid":false,"given":"Yuri","family":"Evtushenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3150-0951","authenticated-orcid":false,"given":"Alexander","family":"Golikov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,4]]},"reference":[{"issue":"8","key":"7_CR1","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1080\/03081087.2011.625497","volume":"60","author":"D Bartl","year":"2012","unstructured":"Bartl, D.: A note on the short algebraic proof of Farkas\u2019 lemma. Linear and Multilinear Algebra 60(8), 897\u2013901 (2012)","journal-title":"Linear and Multilinear Algebra"},{"issue":"1\u20134","key":"7_CR2","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1080\/10556780108805831","volume":"16","author":"CG Broyden","year":"2001","unstructured":"Broyden, C.G.: On theorems of the alternative. Optim. Methods Softw. 16(1\u20134), 101\u2013111 (2001)","journal-title":"Optim. Methods Softw."},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1137\/S0036144594295502","volume":"39","author":"A Dax","year":"1997","unstructured":"Dax, A.: An elementary proof of Farkas\u2019 lemma. SIAM Rev. 39, 503\u2013507 (1997)","journal-title":"SIAM Rev."},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1134\/S1064562419020327","volume":"99","author":"YG Evtushenko","year":"2019","unstructured":"Evtushenko, Y.G., Tret\u2019yakov, A.A., Tyrtyshnikov, E.E.: New approach to Farkas\u2019 theorem of the alternative. Dokl. Math. 99(2), 208\u2013210 (2019)","journal-title":"Dokl. Math."},{"key":"7_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48332-7_521","volume-title":"Encyclopedia of Optimization","author":"F Giannessi","year":"2001","unstructured":"Giannessi, F.: Theorems of the alternative and optimization. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization. Springer, Boston (2001). https:\/\/doi.org\/10.1007\/0-306-48332-7_521"},{"issue":"27","key":"7_CR6","first-page":"77","volume":"25","author":"M Ja\u0107movi\u0107","year":"2011","unstructured":"Ja\u0107movi\u0107, M.: Farkas\u2019 lemma of alternative. Teach. Math. 25(27), 77\u201386 (2011)","journal-title":"Teach. Math."},{"issue":"3","key":"7_CR7","first-page":"354","volume":"43","author":"AI Golikov","year":"2003","unstructured":"Golikov, A.I., Evtushenko, Y.G.: Theorems of the alternative and their applications in numerical methods. Comput. Maths. Math. Phys. 43(3), 354\u2013375 (2003)","journal-title":"Comput. Maths. Math. Phys."},{"key":"7_CR8","series-title":"Applied Optimization","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-1-4613-0241-4_10","volume-title":"High Performance Algorithms and Software for Nonlinear Optimization","author":"YG Evtushenko","year":"2003","unstructured":"Evtushenko, Y.G., Golikov, A.I.: New perspective on the theorems of alternative. In: Di Pillo, G., Murli, A. (eds.) High Performance Algorithms and Software for Nonlinear Optimization. APOP, vol. 82, pp. 227\u2013241. Springer, Boston, MA (2003). https:\/\/doi.org\/10.1007\/978-1-4613-0241-4_10"},{"key":"7_CR9","unstructured":"Forsgren, A., Wright, M.: An elementary proof of linear programming optimality conditions without using Farkas\u2019 lemma (2014). arXiv:1407.1240"},{"key":"7_CR10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971255","volume-title":"Nonlinear Programming","author":"OL Mangasarian","year":"1994","unstructured":"Mangasarian, O.L.: Nonlinear Programming. SIAM, Philadelphia (1994)"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Naval. Res. Log. Quart. 3, 95\u2013110 (1956)","journal-title":"Naval. Res. Log. Quart."},{"issue":"12","key":"7_CR12","first-page":"22","volume":"42","author":"II Eremin","year":"1998","unstructured":"Eremin, I.I.: On quadratic problems and fully quadratic problems in convex programming. Izv. Vyssh. Uchebn. Zaved., Mat. 42(12), 22\u201328 (1998)","journal-title":"Izv. Vyssh. Uchebn. Zaved., Mat."},{"issue":"l","key":"7_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1137\/0705006","volume":"5","author":"D Morrison","year":"1968","unstructured":"Morrison, D.: Optimization by least squares. SIAM J. Numer. Anal. 5(l), 83\u201388 (1968)","journal-title":"SIAM J. Numer. Anal."},{"key":"7_CR14","first-page":"S52","volume":"l","author":"AI Golikov","year":"2002","unstructured":"Golikov, A.I., Evtushenko, Y.G.: Two parametric families of LP problems and their applications. Proc. Steklov Inst. Math. Supp. l, S52\u2013S66 (2002)","journal-title":"Proc. Steklov Inst. Math. Supp."}],"container-title":["Lecture Notes in Computer Science","Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-62867-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T12:02:04Z","timestamp":1619265724000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-62867-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030628666","9783030628673"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62867-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OPTIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"optima2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/agora.guru.ru\/display.php?conf=optima-2020","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.25","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.23","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}