{"id":"https://openalex.org/W7118872277","doi":"https://doi.org/10.48550/arxiv.2601.00874","title":"LLMize: A Framework for Large Language Model-Based Numerical Optimization","display_name":"LLMize: A Framework for Large Language Model-Based Numerical Optimization","publication_year":2025,"publication_date":"2025-12-30","ids":{"openalex":"https://openalex.org/W7118872277","doi":"https://doi.org/10.48550/arxiv.2601.00874"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2601.00874","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.00874","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"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":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2601.00874","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5122234011","display_name":"M. Rizki Oktavian","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Oktavian, M. Rizki","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5122234011"],"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/T10181","display_name":"Natural Language Processing Techniques","score":0.19120000302791595,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.19120000302791595,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11948","display_name":"Machine Learning in Materials Science","score":0.12389999628067017,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10028","display_name":"Topic Modeling","score":0.12139999866485596,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/metaheuristic","display_name":"Metaheuristic","score":0.6129999756813049},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.48170000314712524},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.48170000314712524},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.37599998712539673},{"id":"https://openalex.org/keywords/robust-optimization","display_name":"Robust optimization","score":0.35569998621940613},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.35010001063346863},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.3440999984741211},{"id":"https://openalex.org/keywords/python","display_name":"Python (programming language)","score":0.3434000015258789},{"id":"https://openalex.org/keywords/iterative-and-incremental-development","display_name":"Iterative and incremental development","score":0.31700000166893005}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6585000157356262},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6129999756813049},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5956000089645386},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.48170000314712524},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.48170000314712524},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.37599998712539673},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.35569998621940613},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.35010001063346863},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.3440999984741211},{"id":"https://openalex.org/C519991488","wikidata":"https://www.wikidata.org/wiki/Q28865","display_name":"Python (programming language)","level":2,"score":0.3434000015258789},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3319999873638153},{"id":"https://openalex.org/C143587482","wikidata":"https://www.wikidata.org/wiki/Q1543216","display_name":"Iterative and incremental development","level":2,"score":0.31700000166893005},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.30640000104904175},{"id":"https://openalex.org/C195324797","wikidata":"https://www.wikidata.org/wiki/Q33742","display_name":"Natural language","level":2,"score":0.30230000615119934},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.2989000082015991},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.29840001463890076},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.29339998960494995},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.2874999940395355},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.2842999994754791},{"id":"https://openalex.org/C110850998","wikidata":"https://www.wikidata.org/wiki/Q5377895","display_name":"Engineering optimization","level":3,"score":0.2768999934196472},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.27000001072883606},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.257999986410141},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.25780001282691956},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.2574000060558319},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25609999895095825},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.25209999084472656}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2601.00874","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.00874","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"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":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2601.00874","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.00874","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"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":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Large":[0],"language":[1,12,108],"models":[2],"(LLMs)":[3],"have":[4],"recently":[5],"shown":[6],"strong":[7],"reasoning":[8],"capabilities":[9],"beyond":[10],"traditional":[11],"tasks,":[13],"motivating":[14],"their":[15],"use":[16],"for":[17,159,169],"numerical":[18],"optimization.":[19,146],"This":[20],"paper":[21],"presents":[22],"LLMize,":[23],"an":[24,56],"open-source":[25],"Python":[26],"framework":[27,69],"that":[28,149],"enables":[29],"LLM-driven":[30],"optimization":[31,40,72,115,152],"through":[32,106],"iterative":[33],"prompting":[34],"and":[35,60,79,87,102,142,166,175],"in-context":[36],"learning.":[37],"LLMize":[38,94,126],"formulates":[39],"as":[41],"a":[42,164],"black-box":[43],"process":[44],"in":[45,51,120],"which":[46],"candidate":[47],"solutions":[48],"are":[49,177],"generated":[50],"natural":[52,107],"language,":[53],"evaluated":[54,128],"by":[55,76,84],"external":[57],"objective":[58],"function,":[59],"refined":[61],"over":[62],"successive":[63],"iterations":[64],"using":[65],"solution-score":[66],"feedback.":[67],"The":[68],"supports":[70],"multiple":[71],"strategies,":[73],"including":[74],"Optimization":[75],"Prompting":[77],"(OPRO)":[78],"hybrid":[80],"LLM-based":[81,151],"methods":[82],"inspired":[83],"evolutionary":[85],"algorithms":[86],"simulated":[88],"annealing.":[89],"A":[90],"key":[91],"advantage":[92],"of":[93],"is":[95,127,153],"the":[96,134],"ability":[97],"to":[98,112,179],"inject":[99],"constraints,":[100],"rules,":[101],"domain":[103],"knowledge":[104],"directly":[105],"descriptions,":[109],"allowing":[110],"practitioners":[111],"define":[113],"complex":[114],"problems":[116],"without":[117],"requiring":[118],"expertise":[119],"mathematical":[121],"programming":[122],"or":[123],"metaheuristic":[124],"design.":[125],"on":[129],"convex":[130],"optimization,":[131],"linear":[132],"programming,":[133],"Traveling":[135],"Salesman":[136],"Problem,":[137],"neural":[138],"network":[139],"hyperparameter":[140],"tuning,":[141],"nuclear":[143],"fuel":[144],"lattice":[145],"Results":[147],"show":[148],"while":[150],"not":[154],"competitive":[155],"with":[156],"classical":[157],"solvers":[158],"simple":[160],"problems,":[161],"it":[162],"provides":[163],"practical":[165],"accessible":[167],"approach":[168],"complex,":[170],"domain-specific":[171],"tasks":[172],"where":[173],"constraints":[174],"heuristics":[176],"difficult":[178],"formalize.":[180]},"counts_by_year":[],"updated_date":"2026-01-08T20:10:11.968330","created_date":"2026-01-08T00:00:00"}