Linear programming involves finding the maximum or minimum value of a linear objective function, subject to linear constraints.
The objective function is of the form: \[ Z = ax + by, \] where \( Z \) is the value to be optimized, and \( x, y \) are variables subject to constraints. The correct answer is (B) linear function.
Determine whether each of the following relations are reflexive, symmetric, and transitive.
Show that the relation R in the set R of real numbers, defined as
R = {(a, b): a ≤ b2 } is neither reflexive nor symmetric nor transitive.
Check whether the relation R defined in the set {1, 2, 3, 4, 5, 6} as
R = {(a, b): b = a + 1} is reflexive, symmetric or transitive.