The wireless access point configuration problem in wireless LAN deployment can be formulated as a nonlinear optimization problem with a variable number of parameters. In this paper, strongly-typed genetic programming is applied to solve an abstract version of this problem successfully. It is argued that this problem can be used as a potential benchmark problem for evaluating techniques and investigating issues in strongly typed genetic programming, topologically open-ended synthesis by genetic programming, and simultaneous topological and parametric search.