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

Algorithm 2

Benders algorithm with Pareto-optimal cut.

	.
	Pareto: Find a point .
	Use to solve the independent problem of theorem 2.
	MP: Solve the relaxed MP.
	if infeasible then return infeasible.
	SP: Use to solve the dual SP.
	if dual SP unbounded
	then , goto Pareto.
	,
	.
	if UB − LB >  then goto Pareto.
	return (the dual of ) and .