# coding=utf-8 id = 159 name = 'linear_opt/3' slug = 'linear optimization' description = '''\
A set of points in the plane is defined by the inequalities
X
≤ 5,Y
≥ 0,X
+ Y
≤ 7,X
+ 2*Y
≥ 4 andY
≤ X
+ 5.The predicate linear_opt(X, Y, MaxE)
should return the point (X
, Y
) where the expression E = -0.4*X + 3.2*Y
has the largest value.