Quantrex Quantrex AcademyJEE · NEET · NDA PYQs with solutions Open app
BITSAT 2023Paper 2
Exam
BITSAT
Year
2023
Paper
Paper 2
Subject
Mathematics
Chapter
Linear Programming

BITSAT 2023 · Paper 2 · Mathematics · Linear Programming

Minimum value of Z=3 x+5 y subject to constraints x+y ≥ 2, x+3 y ≥...

Minimum value of Z=3x+5yZ=3 x+5 y subject to constraints x+y≥2,x+3y≥3,x,y≥0x+y \geq 2, x+3 y \geq 3, x, y \geq 0

Options

  1. A
    6
  2. B
    7
  3. C
    8
  4. D
    9

Correct answer

B.
7

Step-by-step solution

Z\mathrm{Z} is 7 minimum at (32,12)\left(\frac{3}{2}, \frac{1}{2}\right)
Practice Linear Programming on Quantrex Academy →

More from Linear Programming

If the number of available constraints is 3 and the number of parameters to be optimise… BITSAT 2024The maximum value of z=5 x+2 y subject to constraints x+y ≤ 7, x+2 y ≤ 10, x, y ≥ 0 BITSAT 2023The maximum value of z=6 x+8 y subject to constraints 2 x+y ≤ 30, x+2 y ≤ 24 and x ≥ 0, y… BITSAT 2020The maximum value of Z = 4x + 2y subject to constraints 2x + 3y ≤ 18, x + y ≥ 10 and x, y… BITSAT 2018The coordinates of the point at which minimum value of Z = 7x - 8y subject to constraints… BITSAT 2018Minimise Z=∑_ j=1 ^ n ∑_ i=1 ^ m c_ i j x_ i j Subject to ∑_ i=1 ^ m x_ i j =b_ j… BITSAT 2015Consider (x)/(2)+(y)/(4) ≥ 1 and (x)/(3)+(y)/(2) ≤ 1, x, y ≥ 0 . Then number of possible… BITSAT 2014A shopkeeper wants to purchase two articles A and B of t price 4 and 3 respectively. He… BITSAT 2013Which of the following is not a vertex of the positive region bounded by the inqualities… BITSAT 2011For the constraints of a L.P. Problem given by x_1+2 x_2 ≤ 2000, x_1+x_2 ≤ 1500 and x_2 ≤… BITSAT 2011 Full Linear Programming list Linear Programming JEE Maths PYQsJEE Mathematics PYQs All BITSAT PYQs