The combination of Software Defined Networking (SDN) and Network Function Virtualization (NFV) promises to provide highly flexible and configurable network infrastructures. This relies, however, on an efficient assignment of the respective Service Function Chain (SFC). This is related to Virtual Network Embedding (VNE), where algorithms are devised to provide such an assignment. To evaluate and compare the efficiency of such algorithms, well-designed embedding problems have to be generated. This paper presents a new mechanism for generating embedding problems: Problems are generated from a given set of SFCs such that each generated problem is known in advance to have an optimal solution. Experimenters can use this approach to investigate specific properties of embedding algorithms. The approach, thereby, facilitates more detailed evaluation.