| dbo:abstract |
La relaxation lagrangienne est une technique de relaxation qui consiste à supprimer des contraintes difficiles en les intégrant dans la fonction objectif en la pénalisant si ces contraintes ne sont pas respectées. (fr) In the field of mathematical optimization, Lagrangian relaxation is a relaxation method which approximates a difficult problem of constrained optimization by a simpler problem. A solution to the relaxed problem is an approximate solution to the original problem, and provides useful information. The method penalizes violations of inequality constraints using a Lagrange multiplier, which imposes a cost on violations. These added costs are used instead of the strict inequality constraints in the optimization. In practice, this relaxed problem can often be solved more easily than the original problem. The problem of maximizing the Lagrangian function of the dual variables (the Lagrangian multipliers) is the Lagrangian dual problem. (en) |
| dbo:wikiPageExternalLink |
https://www.springer.com/mathematics/applications/book/978-3-540-35445-1%7Cedition=Second https://rcin.org.pl/dlibra/publication/edition/139438/content |
| dbo:wikiPageID |
6348084 (xsd:integer) |
| dbo:wikiPageLength |
8836 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID |
1117681668 (xsd:integer) |
| dbo:wikiPageWikiLink |
dbr:Approximation_theory dbr:Relaxation_(approximation) dbr:Penalty_method dbr:Mathematical_optimization dbr:Constrained_optimization dbr:Thomas_L._Magnanti dbc:Relaxation_(approximation) dbc:Convex_optimization dbr:James_B._Orlin dbr:Lagrange_multiplier dbr:Augmented_Lagrangian_method dbr:Ravindra_K._Ahuja dbr:Dual_problem dbr:LP_problem |
| dbp:wikiPageUsesTemplate |
dbt:Cite_book dbt:Cite_journal dbt:Doi dbt:Isbn |
| dcterms:subject |
dbc:Relaxation_(approximation) dbc:Convex_optimization |
| gold:hypernym |
dbr:Method |
| rdf:type |
dbo:Software |
| rdfs:comment |
La relaxation lagrangienne est une technique de relaxation qui consiste à supprimer des contraintes difficiles en les intégrant dans la fonction objectif en la pénalisant si ces contraintes ne sont pas respectées. (fr) In the field of mathematical optimization, Lagrangian relaxation is a relaxation method which approximates a difficult problem of constrained optimization by a simpler problem. A solution to the relaxed problem is an approximate solution to the original problem, and provides useful information. The problem of maximizing the Lagrangian function of the dual variables (the Lagrangian multipliers) is the Lagrangian dual problem. (en) |
| rdfs:label |
Relaxation lagrangienne (fr) Lagrangian relaxation (en) |
| owl:sameAs |
freebase:Lagrangian relaxation wikidata:Lagrangian relaxation dbpedia-fa:Lagrangian relaxation dbpedia-fr:Lagrangian relaxation https://global.dbpedia.org/id/39smN |
| prov:wasDerivedFrom |
wikipedia-en:Lagrangian_relaxation?oldid=1117681668&ns=0 |
| foaf:isPrimaryTopicOf |
wikipedia-en:Lagrangian_relaxation |
| is dbo:wikiPageDisambiguates of |
dbr:Lagrangian |
| is dbo:wikiPageRedirects of |
dbr:Dual_decomposition |
| is dbo:wikiPageWikiLink of |
dbr:Relaxation_(approximation) dbr:List_of_numerical_analysis_topics dbr:Mathematical_optimization dbr:Combinatorial_auction dbr:Quadratic_knapsack_problem dbr:Variable_splitting dbr:Lagrange_multiplier dbr:Image_segmentation dbr:List_of_things_named_after_Joseph-Louis_Lagrange dbr:Lagrangian dbr:Dual_decomposition |
| is foaf:primaryTopic of |
wikipedia-en:Lagrangian_relaxation |