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

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.aml.2009.09.007
+Normal rank
@@ Property / OpenAlex ID @@
+W2131140226
@@ Property / OpenAlex ID: W2131140226 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3997001
@@ Property / cites work: Q3997001 / rank @@
+Normal rank
@@ Property / cites work @@
+Inverse Optimization
@@ Property / cites work: Inverse Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
+Normal rank
@@ Property / cites work @@
+Calculating some inverse linear programming problems
+Normal rank
@@ Property / cites work @@
+The inverse optimal value problem
@@ Property / cites work: The inverse optimal value problem / rank @@
+Normal rank
@@ Property / cites work @@
+A penalty function method for solving inverse optimal value problem
+Normal rank
@@ Property / cites work @@
+Practical bilevel optimization. Algorithms and applications
+Normal rank
@@ Property / cites work @@
+A penalty function method based on Kuhn-Tucker condition for solving linear bilevel programming
+Normal rank
@@ Property / cites work @@
+Descent approaches for quadratic bilevel programming
+Normal rank
@@ Property / cites work @@
+Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
+Normal rank