I don't see how this can be solved using any of the simultaneous equations approaches that I know of.
You are given:
J = John, W = wife, A = Kid #1, B = Kid #2
1) W = J - 1
2) A = B - 1
3) J*W + A + B = 2011
Substituting gives:
4) J^2 - J + 2B = 2012
In order to use a simultaneous equations approach, you would need an additional equation that would allow you to relate A or B in terms of J or W.
If you were supposed to use simultaneous equations to solve this, I think you may have forgotten a statement in the question prompt, such as something like:
"John's youngest child is 1/3 his age."
A = J/3
With this information, you could then use the substitution method to solve the equations.
As you've stated the question here, that type of information wasn't given, so the best you can do is guess-and-check, which wouldn't take too long with this problem.
First, I'd narrow down the range of possible years for the parents' ages by doing some rough calculations. I know that 50*49 is going to be too big (50*50 = 2500), and 40*39 is going to be too small (40*40 = 1600). So the answer must be between 40 and 50. Using some more quick calculations, I'd go through the combinations between 40 and 50 and determine if the product was close enough to 2011 to add in the sum of the kids' ages (kids must be younger than the parents, so the sum will always be less than 100).
For example, 41 * 40 = 1640. This is almost 400 away from 2011, which would make each of the kids around 200 years old. Not possible.
42*41 = 1722. No, almost 300 off.
43*42 = 1806. No, still over 200 off.
44*43 = 1892. No, still over 100 off.
45*44 = 1980. Close, add to possible solutions to check.
46*45 = 2070. No. Over 2011.
Before even calculating the kids' ages, you can see that there is only one possible solution for the parents' ages. Just check to see if the kids' ages will work out to be integers, as the problem states they must be (if they don't then there isn't a solution).
1980 + 2B = 2012
-> B = 16
A = B - 1
-> A = 15
Solved. J = 45, W = 44, A = 15, B = 16.
Not very elegant, but I don't see a quicker way to solve the problem. If someone else could share a method that is cleaner than this I would be very interested to see how it is done.