{"doi":"10.48550/arxiv.1908.04040","title":"Unknown","abstract":null,"journal":null,"year":null,"id":606935,"datarank":0.20794415416798362,"base_score":1.3862943611198906,"endowment":1.3862943611198906,"self_citation_contribution":0.20794415416798362,"citation_network_contribution":0.0,"self_endowment_contribution":0.20794415416798362,"citer_contribution":0.0,"corpus_percentile":null,"corpus_rank":null,"citation_count":3,"citer_count":0,"citers_with_citation_signal":0,"citers_with_endowment":0,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[],"reference_count":0,"raw_metadata":{"has_enrichment":true,"resolved":true,"title":"Near-optimal robust bilevel optimization","abstract":"Bilevel optimization problems embed the optimality of a subproblem as a\\nconstraint of another optimization problem. We introduce the concept of\\nnear-optimality robustness for bilevel optimization, protecting the upper-level\\nsolution feasibility from limited deviations from the optimal solution at the\\nlower level. General properties and necessary conditions for the existence of\\nsolutions are derived for near-optimal robust versions of general bilevel\\noptimization problems. A duality-based solution method is defined when the\\nlower level is convex, leveraging the methodology from the robust and bilevel\\nliterature. Numerical results assess the efficiency of exact and heuristic\\nmethods and the impact of valid inequalities on the solution time.\\n","is_dataset_classified":null,"base_score":1.3862943611198906,"endowment":1.3862943611198906,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"23304386","pmcid":null,"openalex_id":"https://openalex.org/W2968840856","authors":[],"funders":[],"total_grants":0,"fwci":null,"citation_percentile":null,"influential_citations":0,"citation_trend":[{"year":2021,"count":2},{"year":2022,"count":1}],"oa_status":"green","license":"cc-by","oa_locations":[{"url":"https://arxiv.org/pdf/1908.04040","host_type":"repository"},{"url":"http://arxiv.org/abs/1908.04040","host_type":"repository"},{"url":"https://www.research.ed.ac.uk/en/publications/60b01f0d-0a95-4301-8a17-953a6aa0be8a","host_type":"repository"},{"url":"https://hal.archives-ouvertes.fr/hal-02414848","host_type":"repository"},{"url":"https://hal.science/hal-02414848","host_type":"repository"},{"url":"http://hdl.handle.net/20.500.12210/22053","host_type":"repository"},{"url":"http://hdl.handle.net/20.500.12210/57202","host_type":"repository"}],"fields_of_study":["Risk and Portfolio Optimization","Optimization and Variational Analysis","Water resources management and optimization"],"mesh_terms":[],"keywords":["Bilevel optimization","Computer science","Robust optimization","Mathematical optimization","Business","Optimization problem","Mathematics"],"sdg_mappings":[{"sdg_number":0,"sdg_label":"Peace, Justice and strong institutions"}],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-07-30T05:26:55.169347Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}