{"id":"https://openalex.org/W2911215968","doi":"https://doi.org/10.4236/jamp.2019.71003","title":"Easy Simplex (AHA Simplex) Algorithm","display_name":"Easy Simplex (AHA Simplex) Algorithm","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2911215968","doi":"https://doi.org/10.4236/jamp.2019.71003","mag":"2911215968"},"language":"en","primary_location":{"id":"doi:10.4236/jamp.2019.71003","doi":"https://doi.org/10.4236/jamp.2019.71003","is_oa":true,"landing_page_url":"https://doi.org/10.4236/jamp.2019.71003","pdf_url":"http://www.scirp.org/journal/PaperDownload.aspx?paperID=89771","source":{"id":"https://openalex.org/S2764580047","display_name":"Journal of Applied Mathematics and Physics","issn_l":"2327-4352","issn":["2327-4352","2327-4379"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310320480","host_organization_name":"Scientific Research Publishing","host_organization_lineage":["https://openalex.org/P4310320480"],"host_organization_lineage_names":["Scientific Research Publishing"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Applied Mathematics and Physics","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://www.scirp.org/journal/PaperDownload.aspx?paperID=89771","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"A. H. Ansari","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"A. H. Ansari","raw_affiliation_strings":["Journal of Applied Mathematics and Physics","Kejriwal Institute of Management and Development Studies, Ranchi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Journal of Applied Mathematics and Physics","institution_ids":[]},{"raw_affiliation_string":"Kejriwal Institute of Management and Development Studies, Ranchi, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3406,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.60035629,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":93},"biblio":{"volume":"07","issue":"01","first_page":"23","last_page":"30"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9624000191688538,"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"}},"topics":[{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9624000191688538,"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"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.02710000053048134,"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.00839999970048666,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"simplex algorithm","score":0.8370000123977661},{"id":"https://openalex.org/keywords/linear-programming","display_name":"linear programming","score":0.9300000071525574},{"id":"https://openalex.org/keywords/slack-variables","display_name":"slack variables","score":0.8410000205039978},{"id":"https://openalex.org/keywords/constraint-handling","display_name":"constraint handling","score":0.3619999885559082},{"id":"https://openalex.org/keywords/optimal-solution","display_name":"optimal solution","score":0.6710000038146973},{"id":"https://openalex.org/keywords/computational-efficiency","display_name":"computational efficiency","score":0.8130000233650208}],"concepts":[{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.9392653703689575},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.8329931497573853},{"id":"https://openalex.org/C191157680","wikidata":"https://www.wikidata.org/wiki/Q17085895","display_name":"Revised simplex method","level":4,"score":0.807170033454895},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.704529881477356},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.7044336199760437},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.6375617980957031},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5729631185531616},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.439557284116745},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.36702388525009155},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3091620206832886},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09374785423278809}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4236/jamp.2019.71003","doi":"https://doi.org/10.4236/jamp.2019.71003","is_oa":true,"landing_page_url":"https://doi.org/10.4236/jamp.2019.71003","pdf_url":"http://www.scirp.org/journal/PaperDownload.aspx?paperID=89771","source":{"id":"https://openalex.org/S2764580047","display_name":"Journal of Applied Mathematics and Physics","issn_l":"2327-4352","issn":["2327-4352","2327-4379"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310320480","host_organization_name":"Scientific Research Publishing","host_organization_lineage":["https://openalex.org/P4310320480"],"host_organization_lineage_names":["Scientific Research Publishing"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Applied Mathematics and Physics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.4236/jamp.2019.71003","doi":"https://doi.org/10.4236/jamp.2019.71003","is_oa":true,"landing_page_url":"https://doi.org/10.4236/jamp.2019.71003","pdf_url":"http://www.scirp.org/journal/PaperDownload.aspx?paperID=89771","source":{"id":"https://openalex.org/S2764580047","display_name":"Journal of Applied Mathematics and Physics","issn_l":"2327-4352","issn":["2327-4352","2327-4379"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310320480","host_organization_name":"Scientific Research Publishing","host_organization_lineage":["https://openalex.org/P4310320480"],"host_organization_lineage_names":["Scientific Research Publishing"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Applied Mathematics and Physics","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2911215968.pdf","grobid_xml":"https://content.openalex.org/works/W2911215968.grobid-xml"},"referenced_works_count":3,"referenced_works":["https://openalex.org/W2033040247","https://openalex.org/W2072915961","https://openalex.org/W2611147814"],"related_works":["https://openalex.org/W2189477937","https://openalex.org/W2741388726","https://openalex.org/W2133667137","https://openalex.org/W2392611548","https://openalex.org/W1623728342","https://openalex.org/W2359588385","https://openalex.org/W4234883233","https://openalex.org/W2065726315","https://openalex.org/W2368343259","https://openalex.org/W2885351782"],"abstract_inverted_index":{"The":[0,17,84],"purpose":[1],"of":[2,37,41,86,99,121],"this":[3,113],"research":[4],"paper":[5],"is":[6,13,26,45,89,125],"to":[7,46,60,77,90,112],"introduce":[8],"Easy":[9,114],"Simplex":[10,115],"Algorithm":[11,118],"which":[12],"developed":[14],"by":[15,22,54],"author.":[16],"simplex":[18,43,93,109],"algorithm":[19,44,65,88,94],"first":[20],"presented":[21],"G.":[23],"B.":[24],"Dantzing,":[25],"generally":[27],"used":[28],"for":[29],"solving":[30,100],"a":[31],"Linear":[32],"programming":[33],"problem":[34],"(LPP).":[35],"One":[36],"the":[38,42,68,72,92,97,108,119],"important":[39],"steps":[40],"convert":[47],"all":[48],"unequal":[49],"constraints":[50,73],"into":[51],"equal":[52],"form":[53],"adding":[55],"slack":[56],"variables":[57],"then":[58],"proceeds":[59],"basic":[61],"solution.":[62],"Our":[63],"new":[64],"i)":[66],"solves":[67],"LPP":[69,102],"without":[70],"equalize":[71],"and":[74],"ii)":[75],"leads":[76],"optimal":[78],"solution":[79],"definitely":[80,105],"in":[81],"lesser":[82,106],"time.":[83],"goal":[85],"suggested":[87],"improve":[91],"so":[95],"that":[96],"time":[98],"an":[101],"will":[103],"be":[104],"than":[107],"algorithm.":[110],"According":[111],"(AHA":[116],"Simplex)":[117],"use":[120],"Big":[122],"M":[123],"method":[124],"not":[126],"required.":[127]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-10-30T12:39:25.321706","created_date":"2019-01-25T00:00:00"}