{"id":"https://openalex.org/W298619801","doi":null,"title":"New Algorithms: Linear, Nonlinear, and Integer Programming","display_name":"New Algorithms: Linear, Nonlinear, and Integer Programming","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W298619801","mag":"298619801"},"language":"en","primary_location":{"id":"mag:298619801","doi":null,"is_oa":false,"landing_page_url":"https://vixra.org/pdf/1301.0117v1.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S2883122597","display_name":"viXra","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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"viXra","raw_type":null},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018483497","display_name":"Dhananjay P. Mehendale","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Dhananjay P. Mehendale","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5018483497"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.6503999829292297,"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.6503999829292297,"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.22519999742507935,"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.11490000039339066,"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/linear-programming","display_name":"linear programming","score":0.8109999895095825},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"nonlinear programming","score":0.8870000243186951},{"id":"https://openalex.org/keywords/integer-programming","display_name":"integer programming","score":1.0},{"id":"https://openalex.org/keywords/reduced-row-echelon-form","display_name":"reduced row echelon form","score":0.8840000033378601},{"id":"https://openalex.org/keywords/grobner-bases","display_name":"Gr\u00f6bner bases","score":0.8840000033378601},{"id":"https://openalex.org/keywords/linear-diophantine-equations","display_name":"linear Diophantine equations","score":0.9620000123977661}],"concepts":[{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.7473970651626587},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.666311502456665},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.6464052796363831},{"id":"https://openalex.org/C104140500","wikidata":"https://www.wikidata.org/wiki/Q2088159","display_name":"Row and column spaces","level":3,"score":0.5992304682731628},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5882348418235779},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5399172306060791},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.532677948474884},{"id":"https://openalex.org/C60866291","wikidata":"https://www.wikidata.org/wiki/Q5140577","display_name":"Coefficient matrix","level":3,"score":0.49466273188591003},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4614362418651581},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.4332560896873474},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42973294854164124},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41671228408813477},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3586050570011139},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3461451232433319},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.32460933923721313},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23486870527267456},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:298619801","doi":null,"is_oa":false,"landing_page_url":"https://vixra.org/pdf/1301.0117v1.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S2883122597","display_name":"viXra","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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"viXra","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W602453385","https://openalex.org/W1571051474","https://openalex.org/W1965813342","https://openalex.org/W2002273082","https://openalex.org/W2016853911","https://openalex.org/W2057182494","https://openalex.org/W2095007759","https://openalex.org/W2313555298","https://openalex.org/W2578592939","https://openalex.org/W3159460829"],"related_works":["https://openalex.org/W1600578711","https://openalex.org/W4200359667","https://openalex.org/W7095985198","https://openalex.org/W181021771","https://openalex.org/W3158448495","https://openalex.org/W4210759583","https://openalex.org/W7099501749","https://openalex.org/W1532964496","https://openalex.org/W2387835091","https://openalex.org/W6959596708"],"abstract_inverted_index":{"In":[0],"this":[1,56,73,174,202,213,326],"paper":[2],"we":[3,150,344],"propose":[4],"a":[5,22,26,83,164,232,252,363],"new":[6,12,266],"algorithm":[7,13],"for":[8,55,92,222,227,234,254,301,306,362,382],"linear":[9,373],"programming.":[10],"This":[11,289],"is":[14,259,291,354],"based":[15],"on":[16,173],"treating":[17],"the":[18,31,63,76,89,93,105,113,117,121,127,130,134,160,177,192,195,228,248,265,272,293,297,302,346,369,377],"objective":[19,36,64,229,249],"function":[20,65,230,250],"as":[21,67,231,251],"parameter.":[23,70],"We":[24,49,71,102,320],"form":[25,54,80,138,361],"matrix":[27,57,74,119,132,175,203,214,267,314,317],"using":[28],"coefficients":[29],"in":[30,75,120,133,144,163,176,194,201,292],"system":[32,364],"of":[33,116,129,159,190,212,310,348,357,365,371],"equations":[34,39,162,274,375],"consisting":[35],"equation":[37],"and":[38,81,98,237,315,334,340,368],"obtained":[40,207,305],"from":[41],"inequalities":[42],"defining":[43],"constraint":[44,161,273],"by":[45,208,270,276],"introducing":[46],"slack/surplus":[47],"variables.":[48],"obtain":[50],"reduced":[51,77,122,135,178,358],"row":[52,78,123,136,171,179,281,359],"echelon":[53,79,124,137,180,360],"containing":[58],"only":[59],"one":[60],"variable,":[61],"namely,":[62],"itself":[66],"an":[68,355],"unknown":[69],"analyze":[72],"develop":[82],"clear":[84,142],"cut":[85],"method":[86],"to":[87,146,198,260,286,323,330],"find":[88,147],"optimal":[90,148,383],"solution":[91,149,299],"problem":[94,236,303,380],"at":[95,187,269],"hand,":[96],"if":[97],"when":[99],"it":[100,139],"exists.":[101],"see":[103],"that":[104,143,264,295,325],"entire":[106],"optimization":[107],"process":[108],"can":[109],"be":[110,141,261,284],"developed":[111],"through":[112],"proper":[114],"analysis":[115,128],"said":[118,131],"form.":[125,181],"From":[126],"will":[140],"order":[145],"may":[151],"need":[152],"carrying":[153,277],"out":[154,278],"certain":[155,210],"processes":[156],"like":[157],"rearranging":[158,271],"particular":[165],"way":[166],"and/or":[167,275],"performing":[168],"appropriate":[169],"elementary":[170,280],"transformations":[172,282],"These":[182],"operations":[183],"are":[184,318],"mainly":[185],"aimed":[186],"achieving":[188],"nonnegativity":[189],"all":[191,296],"entries":[193],"columns":[196],"corresponding":[197],"nonbasic":[199],"variables":[200,304],"or":[204],"its":[205],"submatrix":[206,216,238],"collecting":[209],"rows":[211,218,240],"(i.e.":[215],"with":[217,239,312,332],"having":[219,241],"negative":[220],"coefficient":[221,243],"parameter":[223,233,244,253],"d,":[224,245],"which":[225],"stands":[226],"maximization":[235],"positive":[242],"again":[246],"representing":[247],"minimization":[255],"problem).":[256],"The":[257],"care":[258],"taken":[262],"so":[263],"arrived":[268],"suitable":[279],"must":[283],"equivalent":[285,356],"original":[287,313],"matrix.":[288],"equivalence":[290],"sense":[294],"feasible":[298],"sets":[300],"different":[307],"possible":[308],"values":[309],"d":[311],"transformed":[316],"same.":[319],"then":[321],"proceed":[322],"show":[324],"idea":[327],"naturally":[328],"extends":[329],"deal":[331],"nonlinear":[333,339,366],"integer":[335,341,378,384],"programming":[336,342,379],"problems.":[337],"For":[338],"problems":[343],"use":[345],"technique":[347],"Grobner":[349,352],"bases":[350],"(since":[351,376],"basis":[353],"equations)":[367],"methods":[370],"solving":[372],"Diophantine":[374],"demands":[381],"solution)":[385],"respectively.":[386]},"counts_by_year":[],"updated_date":"2025-10-10T17:16:08.811792","created_date":"2016-06-24T00:00:00"}