LP problems seek to maximize or minimize some quantity (usually profit or cost) expressed as a(n): . . objective function requirement constraint alternative . In a linear programming problem, if all the decision variables get only binary values (i.e. only 0 or 1), this is an example of: Dynamic programming Mixed programming Integer programming Goal programming . Which one of the following CANNOT be considered as a constraint? You cannot place more than 40 students in one classroom. The maximum amount of time available for welding is 40 hours. Maximize the number of products sold. Each resource can only be assigned only one task . Which one of the following is TRUE about linear programming? Objective function can contain trigonometric or logarithmic functions but constraints cannot. Objective function and the constraints can contain any trigonometric or logarithmic functions. Objective function and the constraints cannot contain any trigonometric or logarithmic functions. Constraints can contain trigonometric or logarithmic functions but the object function cannot. Let A be the number of cars manufactured in a factory, and B be the number of trucks. Each car costs 2000 dollars and each truck costs 5000 dollars. It takes 30 hours to make one car and 55 hours to make one truck. The total number of working hours available in the factory is 75000 hours. The factory manager is trying to figure out a production plan that will minimize the cost of the factory. What is the object function of this problem? . Minimize (2000*B)+(5000*A) Minimize (2000*A)+(5000*B) Minimize (30*A)+(55*B)