Corner points of the feasible region for an LPP are (0,2),(3,0),(6,0), (6,8) and (0,5) . Let F = 4x + 6y be the objective function. The minimum value of F occurs at Solution |c|c| Corner points & Corresponding value of F = 4x + 6y (0,2) & 12 Minimum (3,0) & 12 Minimum (6,0) & 24 (6,8) & 72 Maximum (0,5) & 30 Hence, minimum value of F occurs at any points on the line segment joining the points (0,2) and (3,0) .

By Grade (Class 1–12) By Subject All Courses Virtual Science Labs — NEW Language Courses (Italian·French·Spanish…) Digital Literacy (Certificate) English Grammar & Writing Vedic Maths (30 Modules) R Programming & Data Science Vocabulary Bank Physics Chemistry Biology

Exam Prep Hub — all exams JEE — Maths, Physics & Chemistry NEET — Physics, Chemistry & Biology UPSC Civil Services SSC CGL CTET — Teacher Eligibility (Paper 1 & 2) CAT SAT GRE GMAT IELTS — Reading & Writing AP Calculus AB Maths Olympiad (IMO) · Class 1–12

Practice Tests Online Test Problem of the Day Speed Challenge Formula Library Class 12 Maths Practice Mock Board Paper NCERT Solutions Vocabulary Practice

AI Tutor

Q&A Forum Volunteer & Peer Reviewer Top Reviewers

Linear Programming — Class 12 Maths Solution

exemplar objective MCQ NCERT,Exemp,Q.32,Page,256

Question

Corner points of the feasible region for an LPP are (0,2),(3,0),(6,0), (6,8) and (0,5) . Let $F = 4x + 6y$ be the objective function. The minimum value of $F$ occurs at

Solution

$figure$

Hence, minimum value of $F$ occurs at any points on the line segment joining the points (0,2) and (3,0) .

(a) Only (0,2)
(b) Only (3,0)
(c) the mid-point of the line segment joining the points (0,2) and (3,0)
(d) any point on the line segment joining the points (0,2) and (3,0) ✓ Correct

Step-by-step Solution

Detailed solution coming soon.

← All Linear Programming solutions Practice tests →

NCERT & Exemplar solution for CBSE Class 12 Mathematics, Linear Programming. Curated by Sachin Sharma. Free for all students.