{"id":"https://openalex.org/W2083135504","doi":"https://doi.org/10.1137/060677513","title":"Multiobjective Optimization Through a Series of Single-Objective Formulations","display_name":"Multiobjective Optimization Through a Series of Single-Objective Formulations","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2083135504","doi":"https://doi.org/10.1137/060677513","mag":"2083135504"},"language":"en","primary_location":{"id":"doi:10.1137/060677513","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060677513","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"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/A5089929904","display_name":"Charles Audet","orcid":"https://orcid.org/0000-0002-3043-5393"},"institutions":[{"id":"https://openalex.org/I45683168","display_name":"Polytechnique Montr\u00e9al","ror":"https://ror.org/05f8d4e86","country_code":"CA","type":"education","lineage":["https://openalex.org/I45683168"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Charles Audet","raw_affiliation_strings":["charles.audet@gerad.ca and gilles.savard@polymtl.ca#TAB#"],"affiliations":[{"raw_affiliation_string":"charles.audet@gerad.ca and gilles.savard@polymtl.ca#TAB#","institution_ids":["https://openalex.org/I45683168"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017686425","display_name":"Gilles Savard","orcid":"https://orcid.org/0000-0002-0527-6730"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gilles Savard","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5068356062","display_name":"Walid Zghal","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Walid Zghal","raw_affiliation_strings":["walid.zghal@gerad.ca#TAB#"],"affiliations":[{"raw_affiliation_string":"walid.zghal@gerad.ca#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5089929904"],"corresponding_institution_ids":["https://openalex.org/I45683168"],"apc_list":null,"apc_paid":null,"fwci":9.0552,"has_fulltext":false,"cited_by_count":138,"citation_normalized_percentile":{"value":0.98125358,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"19","issue":"1","first_page":"188","last_page":"210"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9912999868392944,"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/T11115","display_name":"Topology Optimization in Engineering","score":0.9876000285148621,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.7358138561248779},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7321267127990723},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7240366339683533},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.6598731875419617},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.6077874898910522},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5746188163757324},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.48249268531799316},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.0651291012763977}],"concepts":[{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.7358138561248779},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7321267127990723},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7240366339683533},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.6598731875419617},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.6077874898910522},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5746188163757324},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.48249268531799316},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0651291012763977},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"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":2,"locations":[{"id":"doi:10.1137/060677513","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060677513","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:publications.polymtl.ca:21169","is_oa":false,"landing_page_url":"https://publications.polymtl.ca/21169/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401013","display_name":"PolyPublie (\u00c9cole Polytechnique de Montr\u00e9al)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45683168","host_organization_name":"Polytechnique Montr\u00e9al","host_organization_lineage":["https://openalex.org/I45683168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article de revue"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W251973404","https://openalex.org/W1493249195","https://openalex.org/W1550542145","https://openalex.org/W1967298113","https://openalex.org/W1977310087","https://openalex.org/W1998855065","https://openalex.org/W1999941513","https://openalex.org/W2014337138","https://openalex.org/W2024008934","https://openalex.org/W2036255495","https://openalex.org/W2044155535","https://openalex.org/W2054875385","https://openalex.org/W2068480996","https://openalex.org/W2069936656","https://openalex.org/W2097273628","https://openalex.org/W2152551290","https://openalex.org/W2153015072"],"related_works":["https://openalex.org/W3094456605","https://openalex.org/W2744462909","https://openalex.org/W4287635425","https://openalex.org/W3127946984","https://openalex.org/W3097111480","https://openalex.org/W2029959045","https://openalex.org/W2111219748","https://openalex.org/W2394981641","https://openalex.org/W1994436307","https://openalex.org/W2329573458"],"abstract_inverted_index":{"This":[0],"work":[1],"deals":[2],"with":[3,75],"bound":[4],"constrained":[5],"multiobjective":[6],"optimization":[7,70],"(MOP)":[8],"of":[9,17,39,55,58,101,109,112],"nonsmooth":[10,128],"functions":[11,20,33],"for":[12,67,127],"problems":[13,116,153],"where":[14],"the":[15,18,32,37,68,102,120,146,155],"structure":[16],"objective":[19,77],"either":[21],"cannot":[22],"be":[23,85],"exploited,":[24],"or":[25,170,177],"are":[26,34,117],"absent.":[27],"Typical":[28],"situations":[29],"arise":[30],"when":[31],"computed":[35],"as":[36,50,52,167],"result":[38],"a":[40,63,107,168,178],"computer":[41],"simulation.":[42],"We":[43],"first":[44,139],"present":[45],"definitions":[46],"and":[47,89],"optimality":[48,142],"conditions":[49,143],"well":[51],"two":[53,76],"families":[54],"single-objective":[56,110,115],"formulations":[57,111],"MOP.":[59],"Next,":[60],"we":[61],"propose":[62],"new":[64],"algorithm":[65,126],"called":[66],"biobjective":[69,164],"(BOP)":[71],"problem":[72],"(i.e.,":[73],"MOP":[74,92],"functions).":[78],"The":[79,130],"property":[80],"that":[81],"Pareto":[82,103,131,172,175,180],"points":[83],"may":[84],"ordered":[86],"in":[87,91,163],"BOP":[88],"not":[90],"is":[93,134,150],"exploited":[94],"by":[95,105],"our":[96],"algorithm.":[97],"generates":[98],"an":[99],"approximation":[100,133],"front":[104,132],"solving":[106],"series":[108],"BOP.":[113],"These":[114],"solved":[118],"using":[119],"recent":[121],"(mesh":[122],"adaptive":[123],"direct":[124],"search)":[125],"optimization.":[129],"shown":[135],"to":[136,158],"satisfy":[137],"some":[138],"order":[140],"necessary":[141],"based":[144],"on":[145,152],"Clarke":[147],"calculus.":[148],"Finally,":[149],"tested":[151],"from":[154],"literature":[156],"designed":[157],"illustrate":[159],"specific":[160],"difficulties":[161],"encountered":[162],"optimization,":[165],"such":[166],"nonconvex":[169],"disjoint":[171],"front,":[173],"local":[174],"fronts,":[176],"nonuniform":[179],"front.":[181]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":14},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":8}],"updated_date":"2026-04-24T08:23:43.765630","created_date":"2025-10-10T00:00:00"}