A homotopy method for solving bilevel programming problem
type: Item
instance of: scholarly article
title: A homotopy method for solving bilevel programming problem
zbMATH Open document ID: 1067.90131
author: Qing Xu
author: Zhenghua Lin
author: Daoli Zhu
published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods
publication date: 2004-10-04T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 2106063
MaRDI profile type: Publication
full work available at URL: j.na.2004.03.022
OpenAlex ID: W1971058617
cites work: A solution method for the static constrained Stackelberg problem via penalty method
cites work: Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming
cites work: Q3998344
cites work: Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
cites work: A Representation and Economic Interpretation of a Two-Level Programming Problem
cites work: Q3657778
cites work: A nonlinear bilevel model for analysis of electric utility demand-side planning issues
cites work: Double penalty method for bilevel optimization problems
cites work: Derivative evaluation and computational experience with large bilevel mathematical programs
cites work: Load adaptive pricing: An emerging tool for electric utilities
cites work: Exact and inexact penalty methods for the generalized bilevel programming problem
cites work: The Projective SUMT Method for Convex Programming
cites work: A multilevel analysis of agricultural credit distribution in East Java, Indonesia
cites work: The steepest descent direction for the nonlinear bilevel programming problem
cites work: A new computational method for Stackelberg and min-max problems by use of a penalty method
DOI: 10.1016/J.NA.2004.03.022
description: scientific article; zbMATH DE number 2106063