{"id":"https://openalex.org/W2019937404","doi":"https://doi.org/10.1109/uksim.2012.54","title":"A Novel Algorithm for Linear Programming","display_name":"A Novel Algorithm for Linear Programming","publication_year":2012,"publication_date":"2012-03-01","ids":{"openalex":"https://openalex.org/W2019937404","doi":"https://doi.org/10.1109/uksim.2012.54","mag":"2019937404"},"language":"en","primary_location":{"id":"doi:10.1109/uksim.2012.54","doi":"https://doi.org/10.1109/uksim.2012.54","is_oa":false,"landing_page_url":"https://doi.org/10.1109/uksim.2012.54","pdf_url":null,"source":{"id":"https://openalex.org/S7407088653","display_name":"UKSim International Conference on Computer Modelling and Simulation (UKSim)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1303.4942","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044839227","display_name":"Kumar Eswaran","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I10874241","display_name":"Jawaharlal Nehru Technological University, Hyderabad","ror":"https://ror.org/002tchr49","country_code":"IN","type":"education","lineage":["https://openalex.org/I10874241"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Kumar Eswaran","raw_affiliation_strings":["Department of Computer Science, SNIST, Jawaharlal Nehru Technological University, Hyderabad, India","Dept. of Comput. Sci., Jawaharlal Technol. Univ., Ghatkesar, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, SNIST, Jawaharlal Nehru Technological University, Hyderabad, India","institution_ids":["https://openalex.org/I10874241"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Jawaharlal Technol. Univ., Ghatkesar, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5044839227"],"corresponding_institution_ids":["https://openalex.org/I10874241"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"328","last_page":"333"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.8583999872207642,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.8583999872207642,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.12129999697208405,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.016100000590085983,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/linear-programming","display_name":"linear programming","score":1.0},{"id":"https://openalex.org/keywords/dimensionality-reduction","display_name":"dimensionality reduction","score":0.8270000219345093},{"id":"https://openalex.org/keywords/recursive-algorithm","display_name":"recursive algorithm","score":0.8939999938011169},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"convex optimization","score":0.847000002861023},{"id":"https://openalex.org/keywords/nonlinear-constraints","display_name":"nonlinear constraints","score":0.8500000238418579},{"id":"https://openalex.org/keywords/interior-point-methods","display_name":"interior point methods","score":0.5249999761581421}],"concepts":[{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.7145562171936035},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6378399133682251},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6153007745742798},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5555360317230225},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5361585021018982},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4958377778530121},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.48186954855918884},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4527074694633484},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4505128264427185},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4343471825122833},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4049467444419861},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.31819212436676025},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09155064821243286},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/uksim.2012.54","doi":"https://doi.org/10.1109/uksim.2012.54","is_oa":false,"landing_page_url":"https://doi.org/10.1109/uksim.2012.54","pdf_url":null,"source":{"id":"https://openalex.org/S7407088653","display_name":"UKSim International Conference on Computer Modelling and Simulation (UKSim)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1303.4942","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/1303.4942","pdf_url":"https://arxiv.org/pdf/1303.4942","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.1303.4942","doi":"https://doi.org/10.48550/arxiv.1303.4942","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1303.4942","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1303.4942","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/1303.4942","pdf_url":"https://arxiv.org/pdf/1303.4942","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2019937404.pdf","grobid_xml":"https://content.openalex.org/works/W2019937404.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W2032938251","https://openalex.org/W2033040247","https://openalex.org/W2044413922","https://openalex.org/W2135108679","https://openalex.org/W2169287093","https://openalex.org/W2611147814","https://openalex.org/W3143893444","https://openalex.org/W3145167355","https://openalex.org/W3208631335","https://openalex.org/W4236123175","https://openalex.org/W4248313157","https://openalex.org/W4301216918"],"related_works":["https://openalex.org/W7099501749","https://openalex.org/W2072823736","https://openalex.org/W2004228706","https://openalex.org/W170842043","https://openalex.org/W2016937181","https://openalex.org/W4250774990","https://openalex.org/W2386790581","https://openalex.org/W2746101295","https://openalex.org/W2076768004","https://openalex.org/W2351592805"],"abstract_inverted_index":{"The":[0,85],"problem":[1,19,58,77,105],"of":[2,11,24,75,93],"optimizing":[3],"a":[4,9,16,37,50,60,69,102,111],"linear":[5,12,103],"objective":[6],"function,":[7],"given":[8],"number":[10],"constraints":[13,109],"has":[14],"been":[15,34],"long":[17],"standing":[18],"ever":[20],"since":[21],"the":[22,64,73,76],"times":[23],"Kantorovich,":[25],"Dantzig":[26],"and":[27,43,81],"John":[28],"von":[29],"Neumann.":[30],"These":[31],"developments":[32],"have":[33],"followed":[35],"by":[36,41,79],"different":[38],"approach":[39,52],"pioneered":[40],"Khachiyan":[42],"Karmarkar.":[44],"In":[45],"this":[46],"paper":[47],"we":[48,67],"attempt":[49],"new":[51],"for":[53,100],"solving":[54,101],"an":[55],"old":[56],"optimization":[57,94,104],"in":[59,63,96,110],"novel":[61],"manner,":[62],"sense":[65],"that":[66,71],"devise":[68],"method":[70,86],"reduces":[72],"dimension":[74],"step":[78,80],"interestingly":[82],"is":[83],"recursive.":[84],"can":[87],"be":[88],"extended":[89],"to":[90,107],"other":[91],"types":[92],"problems":[95],"convex":[97,112],"space,":[98],"e.g.":[99],"subject":[106],"nonlinear":[108],"region.":[113]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}