problem: to maximise the odds that a guy with these qualities exist

let G = good looks
H= good sense of humour
HT= height
B= build
C= good character

on a index of 1 to 10. 1 being the least important.

max G+H+HT+B+C
subject to

H > 8
HT = 10
G > 6 (i am not superficial see? HAHA)
B > 7
C > 8


using Management Scientist, the solution to the linear program is UNBOUNDED! meaning that there is no optimal solution to the problem because the objective function can be made infintely large

THEREFORE.

since such a guy is also known as Prince Charming, and there is no optimal solution to the question of whether such a guy really exists

THEREFORE

prince charming does not exist!





HAHAHAHHAHAHAHA. Linear programming ROCKS!! (cmon jiayin. AGREE WITH ME!)




erm. please don't try to analyse the question. it's a whole load of rubbish, and i know it.