CUET UG Linear Programming — practice questions
20 free MCQs with worked solutions. Tap any question for the answer + explanation, or practice them all in the app.
Practice CUET UG Linear Programming in the app →Linear programming problems seek to maximise or:Linear programming is a class of which problems?The function to be maximised or minimised is the:The restrictions on the variables are called:The conditions x >= 0 and y >= 0 are called:The region satisfying all constraints is called:A point outside the feasible region is an:Points within and on the boundary of the feasible region are:Linear programming problems here are solved by which method?The optimal value of Z occurs at which points of the region?If the feasible region R is bounded, Z has:If the feasible region is unbounded, an optimum may:A feasible region is bounded if it can be:The region other than the feasible region is called:In the worked example, Z equals 250x plus:Theorem 1 describes the feasible region as a:The point (25, 40) in the worked problem is:Corner points of a feasible region are also called its:A linear programming problem must have constraints that are:Some problems minimise a linear function subject to given: