A penalty function method based on bilevel programming for solving inverse optimal value problems (Q710987): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3997001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of an inverse shortest paths algorithm for recovering linearly correlated costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating some inverse linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse optimal value problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A penalty function method for solving inverse optimal value problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical bilevel optimization. Algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A penalty function method based on Kuhn-Tucker condition for solving linear bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descent approaches for quadratic bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems / rank
 
Normal rank

Latest revision as of 09:27, 3 July 2024

scientific article
Language Label Description Also known as
English
A penalty function method based on bilevel programming for solving inverse optimal value problems
scientific article

    Statements