A Competitive Bilevel Programming Model for Green, CLSCs in Light of Government Incentives

Algorithm 1

Benders algorithm.

	.
	MP: Solve the relaxed MP.
	if infeasible then return infeasible.
	SP: Use to solve the dual SP.
	if dual SP unbounded
	then ← , goto MP.
	,
	.
	if UB − LB >  then goto MP.
	return (the dual of ) and .