Practicing Success
Home
About Us
Team
About CUET
cuet-ug Exam Info 1
Important Information and Dates
Registration and Application Form
Fee Payable by Candidates
cuet-ug Exam Info 2
Broad features
Exam Scheme
Combinations
cuet-ug Exam Info 3
Exam Pattern
Exam Slots
List of Languages
cuet-ug Exam Info 4
Domain Subject Syllabus
Participating Universities
Plans
Offerings
Chapterwise Mocks
Full Subject Mocks
Prev. Yrs. Papers
All India Tests
News & Articles
Expert Blogs
Notifications
Login
Register
Start Free Mocks
Follow :
Ace Your
CUET Preparation Today
Start Free Mocks
Home
Questions
RQ5RDG96VV
Target Exam
CUET
Subject
-- Mathematics - Section B1
Chapter
Linear Programming
Question:
Maximize \(z=3z+5y\), subject to constraints: \(x+4y\leq 24,3x+y\leq 21,x+y\leq 9,x\geq0,y\geq 0\)
Options:
\(20\) at \((1,0)\)
\(30\) at \((0,6)\)
\(37\) at \((4,5)\)
\(33\) at \((6,3)\)
Correct Answer:
\(37\) at \((4,5)\)
Explanation:
Sketch the region
CUET Questions
How are the imports of a count...
A sentence has been given with...
Which of the following countri...
Radha saves 25% of her income....
What is the average of numbers...
ΔABC and ΔDEF are ...
Consider the following stateme...
Id works on the which principl...
In the following question, a s...
For which of the following fun...