CUET Mathematics - The vertices of a closed convex polygon representing the feasible region of the LPP with, objective function z = 5x + 3y are (0, 0), (3, 1), (1, 3) and (0, 2). The maximum value of z is | PYQs + Solutions

CUET Mathematics 2022 10 Aug Shift 1

Algebra

Easy

✅ Correct Option: 2

Related questions:

22 May Shift 2

Consider the LPP: Maximize $z = 5x + 3y$ subject to $3x + 5y \leq 15$ , $5x + 2y \leq 10$ , $x,y \geq 0$ . The optimal feasible solution occurs at

22 May Shift 3

Owner of a whole sale computers shop plans to sell 2 types of computers. A desktop and portable model. If $x$ is the number of desktops and $y$ is the number of portable model and the shop's capacity cannot exceed 250 units. Which of the following is correct ?

29 May Shift 2

The feasible region of a LPP is bounded. The corresponding objective function is Z= 6x - 7y. Then objective function attains:

CUET Mathematics 2022 10 Aug Shift 1 PYQs

Keyboard Shortcuts