MAX-3LIN-EQN is a computational problem that falls within the realm of optimization and computational complexity theory. It is a specific case of the broader MAX-CSP (Maximum Constraint Satisfaction Problem) problems. In MAX-3LIN-EQN, the goal is to find an assignment of values (often binary, i.e., 0 or 1) to a set of variables such that the number of satisfied equations is maximized. Each equation is linear and involves three variables.
New to topics? Read the docs here!