The codon-pair optimum is the provable global optimum of summed codon-pair half-life, found by dynamic programming. The structure optimum comes from LinearCDSfold, which solves the folding and codon choice together and returns the exact minimum free energy. A local search then starts from each and trades one against the other at the chosen λ.