Algorithm 1.

Light Source Reduction (LSR) Algorithm

Inputs: mvs, umvs, m0	// Number of virtual sources and their positions,
	// and maximum number of sources to consider, m0
Outputs: $\mathcal{S}$	// Set of plans with 1 to m0 sources
1: Run the LP in Eq. (3) on the mvs sources, and get the output power vector xvs.
2: Pick the m0 sources with the highest powers from xvs, and their coordinates um0.
3: $\mathcal{S}$ := {(m0, xm0, um0)}
4: m := m0 − 1
5: while m ≥ 1 do
6:   Pick the m sources with the highest powers from xm+1, and their coordinates um.
7:   Run the LP in Eq. (3) on the m sources.
8:   Get the output vector of the LP, xm.
9:   $\mathcal{S}$ := $\mathcal{S}$ ∪ {(m, xm, um)}
10:   m := m − 1
11: end while
12: return $\mathcal{S}$