CUET Mathematics - Applied Mathematics - Linear Programming | Free Questions - Page 2

Q1:

2022: 25 May Shift 1

Applied Mathematics

>

Linear Programming

Easy

Applied

Match List I with List II

LIST I	LIST II
A. A solution that does not satisfy all the constraints is called	I. Linear
B. The objective function in an LPP is	II. Convex polygon
C. Linear inequalities or equations on the variables of LPP are called	III. Infeasible solution
D. The feasible region in an LPP, formed by the convex combinations of the corner points, is called	IV. Constraints

Choose the correct answer from the options given below:

A-II, B-III, C-I, D-IV

A-I, B-II, C-IV, D-III

A-III, B-I, C-IV, D-II

A-IV, B-II, C-III, D-I

Correct Answer

Option 3

Correct Answer

Explanation

Q2:

2022: 25 May Shift 1

Applied Mathematics

>

Linear Programming

Hard

Applied

The minimum value of $Z = 30x + 10y$ subject to the constraints $x + 2y \leq 30, 3x + y \geq 30, 4x + 3y \geq 60, x, y \geq 0$ is

200

270

300

350

Correct Answer

Option 3

Correct Answer

Explanation

Q3:

2022: 25 May Shift 1

Applied Mathematics

>

Linear Programming

Medium

Applied

If the objective function $Z = px + qy$ ( $p, q > 0$ ) of an LPP has minimum value 7p, at the corner points (2, 3) and (7, 0), then

$3p = 5q$

$5p = 3q$

$2p = 3q$

$3p = q$

Correct Answer

Option 2

Correct Answer

Explanation

CUET Mathematics: Applied MathematicsLinear Programming. Free, no login required.

Q1:

Q2:

Q3:

CUET Mathematics Past Year Questions (Topic-Wise)