Consider a linear machine with discriminant functions Show that the decision regions are convex byshowing that if x1 ∈ Ri and

Use the minimum-entry and u-v methods to solve the following minimum-cost transportationproblem. Assuming there is no cost associated with the artificial warehouse or market.Use Bland’s rule to choose entering and leaving variables where variables/cells are ordered from topto bottom and left to right.

Are there any more local or global maximums or minimums?  Use Lagrange Multipliers to determine the absolute extrema of f on the indicated constraint and label which ones are absolute extrema (global maximums, and global minimums).

Indicate that  R and R2 may be covered by countably many open balls.