{"id":"https://openalex.org/W7225802953","doi":"https://doi.org/10.21203/rs.3.rs-11526508/v1","title":"Goal Programming, ReLU Networks and Endogenous Priorities: An \u03b1-Fair Unification of Scalarization","display_name":"Goal Programming, ReLU Networks and Endogenous Priorities: An \u03b1-Fair Unification of Scalarization","publication_year":2026,"publication_date":"2026-11-12","ids":{"openalex":"https://openalex.org/W7225802953","doi":"https://doi.org/10.21203/rs.3.rs-11526508/v1"},"language":"en","primary_location":{"id":"doi:10.21203/rs.3.rs-11526508/v1","doi":"https://doi.org/10.21203/rs.3.rs-11526508/v1","is_oa":true,"landing_page_url":"https://doi.org/10.21203/rs.3.rs-11526508/v1","pdf_url":null,"source":{"id":"https://openalex.org/S4306525896","display_name":"Research Square","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Research Square","raw_type":"posted-content"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.21203/rs.3.rs-11526508/v1","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111274872","display_name":"Manish Bajpai","orcid":"https://orcid.org/0009-0007-2383-754X","observed_orcids":["https://orcid.org/0009-0007-2383-754X"]},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Manish Bajpai","raw_affiliation_strings":["University of Delaware"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Delaware","institution_ids":["https://openalex.org/I86501945"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5111274872"],"corresponding_institution_ids":["https://openalex.org/I86501945"],"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.7592999935150146,"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.7592999935150146,"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/T10050","display_name":"Multi-Criteria Decision Making","score":0.2037000060081482,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.020899999886751175,"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":[],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6309999823570251},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5516999959945679},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5403000116348267},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.4936000108718872},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.47360000014305115},{"id":"https://openalex.org/C2780821815","wikidata":"https://www.wikidata.org/wiki/Q5340806","display_name":"Portfolio","level":2,"score":0.3889000117778778},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.37860000133514404},{"id":"https://openalex.org/C2681867","wikidata":"https://www.wikidata.org/wiki/Q690935","display_name":"Saddle point","level":2,"score":0.36340001225471497},{"id":"https://openalex.org/C2778599509","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto efficiency","level":3,"score":0.352400004863739},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.3395000100135803},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.32269999384880066},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.31769999861717224},{"id":"https://openalex.org/C74510933","wikidata":"https://www.wikidata.org/wiki/Q1936145","display_name":"Project portfolio management","level":3,"score":0.31630000472068787},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.3140999972820282},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.3052000105381012},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.29789999127388},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.2946999967098236},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.29339998960494995},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.28679999709129333},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.2773999869823456},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.2759000062942505},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2669999897480011},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.2660999894142151},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.26499998569488525},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.25600001215934753},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.25110000371932983},{"id":"https://openalex.org/C188441871","wikidata":"https://www.wikidata.org/wiki/Q7554146","display_name":"Softmax function","level":3,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.21203/rs.3.rs-11526508/v1","doi":"https://doi.org/10.21203/rs.3.rs-11526508/v1","is_oa":true,"landing_page_url":"https://doi.org/10.21203/rs.3.rs-11526508/v1","pdf_url":null,"source":{"id":"https://openalex.org/S4306525896","display_name":"Research Square","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Research Square","raw_type":"posted-content"}],"best_oa_location":{"id":"doi:10.21203/rs.3.rs-11526508/v1","doi":"https://doi.org/10.21203/rs.3.rs-11526508/v1","is_oa":true,"landing_page_url":"https://doi.org/10.21203/rs.3.rs-11526508/v1","pdf_url":null,"source":{"id":"https://openalex.org/S4306525896","display_name":"Research Square","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Research Square","raw_type":"posted-content"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Weighted":[1],"goal":[2,46,65],"programming":[3,47,66],"and":[4,63,136,149,181,183,199],"the":[5,24,41,68,77,81,104,121,126,131,141,157,176,201,218,227,234],"feedforward":[6],"neural":[7],"network":[8,54,95],"both":[9],"rank":[10],"alternatives":[11],"by":[12,72,152,167],"a":[13,29,52,86,90,109,117,153,163,168,185,206],"weighted":[14,42,45],"aggregate":[15],"of":[16,55,103,120,205,209,238],"criteria":[17],"plus":[18],"an":[19,27,34],"offset.":[20],"We":[21,74],"show":[22,213],"that":[23,214],"resemblance":[25],"is":[26,33,39,51,67,97,108,144,150,230],"identity:":[28],"linear":[30,57],"achievement":[31],"function":[32],"affine":[35],"neuron":[36],"whose":[37],"bias":[38],"minus":[40],"aspiration":[43],"level,":[44],"with":[48,59,89],"one-sided":[49],"deviations":[50],"one-hidden-layer":[53],"rectified":[56],"units":[58],"nonnegative":[60],"readout":[61],"weights,":[62],"Chebyshev":[64],"same":[69],"layer":[70],"followed":[71],"max-pooling.":[73],"then":[75],"let":[76],"priorities":[78,216],"depend":[79],"on":[80,114,146,196,200],"alternative":[82],"being":[83,224],"evaluated":[84],"through":[85],"power":[87],"rule":[88],"single":[91],"exponent,":[92],"which":[93,166],"in":[94],"terms":[96],"softmax":[98],"attention.":[99],"Every":[100],"fixed":[101,142],"point":[102,119,143],"induced":[105],"weighted-sum":[106],"iteration":[107],"supported":[110],"Pareto":[111,172,193],"optimum":[112],"and,":[113,232],"convex":[115,147],"problems,":[116],"stationary":[118],"wellknown":[122],"alpha-fair":[123],"aggregate,":[124],"so":[125],"exponent":[127,177],"spans":[128],"extreme-point":[129],"seeking,":[130],"equal-weight":[132],"sum,":[133],"Nash":[134],"bargaining":[135],"max\u2013min":[137,228],"compromise;":[138],"below":[139],"one,":[140,182],"unique":[145],"problems":[148,198],"computed":[151],"Frank\u2013Wolfe":[154],"scheme.":[155],"Maximizing":[156],"self-weighted":[158],"score":[159],"directly":[160],"instead":[161],"maximizes":[162],"Lehmer":[164],"mean,":[165],"classical":[169],"property":[170],"respects":[171],"dominance":[173],"exactly":[174],"when":[175],"lies":[178],"between":[179],"zero":[180],"selects":[184],"different":[186],"compromise.":[187],"Fixed":[188],"points":[189],"never":[190],"reach":[191],"unsupported":[192,231],"points.":[194],"Experiments":[195],"test":[197],"2010":[202],"project":[203],"portfolio":[204,220,229],"U.S.":[207],"Department":[208],"Defense":[210],"conservation":[211],"programme":[212],"endogenous":[215],"recover":[217],"goal-programming":[219],"without":[221],"any":[222],"weights":[223],"chosen,":[225],"while":[226],"as":[233],"theory":[235],"predicts,":[236],"out":[237],"their":[239],"reach.":[240]},"counts_by_year":[],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2026-11-12T00:00:00"}