Examsnet
Unconfined exams practice
Home
Indian Exams
Banking Entrance Exams
CUET Exam Papers
Defence Exams
Engineering Exams
Finance Entrance Exams
GATE Exam Practice
Insurance Exams
International Exams
JEE Exams
LAW Entrance Exams
MBA Entrance Exams
MCA Entrance Exams
Medical Entrance Exams
Other Entrance Exams
Police Exams
Public Service Commission (PSC)
RRB Entrance Exams
SSC Exams
State Govt Exams
Subjectwise Practice
Teacher Exams
SET Exams(State Eligibility Test)
UPSC Entrance Exams
Aptitude
Algebra and Higher Mathematics
Arithmetic
Commercial Mathematics
Data Based Mathematics
Geometry and Mensuration
Number System and Numeracy
Problem Solving
Indian 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
Certifications
Technical
Cloud Tech Certifications
Security Tech Certifications
Management
IT Infrastructure
Africa Exams
Kenya Previous Papers
Rwanda Previous Papers
Uganda Previous Papers
More
About
Careers
Contact Us
Our Apps
Privacy
Test Index
CUET UG Math 19 Jun 2023 Paper
Show Para
Hide Para
Share question:
© examsnet.com
Question : 49
Total: 50
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
Solution:
© examsnet.com
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