Exams Net
Unrestricted Exams Practice
Home
Exams
Banking
CUET
Defence
Engineering
Finance
GATE
Insurance
International
JEE
LAW
MBA
MCA
Medical
Other
Police
PSC
RRB
SSC
State Govt
Subjectwise
Teacher
SET Exams
UPSC
Aptitude
Algebra and Higher Mathematics
Arithmetic
Commercial Mathematics
Data Based Mathematics
Geometry and Mensuration
Number System and Numeracy
Problem Solving
Board Exams
Andhra
Bihar
CBSE
Gujarat
Haryana
ICSE
Jammu and Kashmir
Karnataka
Kerala
Madhya Pradesh
Maharashtra
Odisha
Tamil Nadu
Telangana
Uttar Pradesh
English
Competitive English
CBSE
CBSE Class 10 Solutions
CBSE Class 12 Solutions
CBSE Question Papers (Pdf)
NCERT Books (Pdf)
NCERT Exemplar Books (Pdf)
NCERT Study Notes (Pdf)
CBSE Study Concepts (Pdf)
NCERT Text Book Class 11 Solutions
NCERT Text Book Class 12 Solutions
ICSE Class 10 Papers
Certifications
Technical
Cloud Tech Certifications
Security Tech Certifications
Management
IT Infrastructure
More
About
Contact Us
Our Apps
Privacy
+
-
Test Index
CUET UG Math 19 Jun 2023 Paper
Show Para
Hide Para
Share question:
© examsnet.com
Question : 49 of 50
Marks:
+1
,
-0
A manufacturing company makes two models M
1
and M
2
of a product. Each piece of M
1
requires 9 labour hours for fabricating and one labour hour for finishing. Each piece of M
2
require 12 labour hours for fabricating and 3 labour hours for finishing. For fabricating and finishing, the maximum labour hours available are 180 and 30 respectively. The company makes a profit of Rs. 800 on each piece of M
1
and Rs.1200 on each piece of M
2
The above Linear Programming Problem [LPP] is given by
Maximize Z = 800x + 1200y
Subject to constraints,
3x + 4y ≤ 60
x + 3y ≤ 30
x, y ≥ 0
Maximize Z = 800x + 1200y
Subject to constraints,
3x + 4y ≥ 60
x + 3y ≥ 30
x, y ≥ 0
Maximize Z = 800x + 1200y
Subject to constraints,
3x + 4y ≤ 60
x + 3y ≥ 30
x, y ≥ 0
Maximize Z = 800x + 1200y
Subject to constraints,
3x + 4y ≥ 60
x + 3y ≤ 30
x, y ≥ 0
Validate
Go to Question:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
Prev Question
Next Question