Mathbee CBSE Mathbee · CBSE Class 12 Maths
Class 12 Linear Programming · Mcq Single Correct1 Markscorner_point_optimization

Class 12 Maths · Linear Programming · Mcq Single Correct #11

A bounded feasible polygon has vertices (0,0),(5,0),(6,5),(6,8),(4,10),(0,8). Where is Z=3x−4y minimum?
Coordinate-derived feasible-region graph for cbse12-math-lp-p1-mcq-011
Coordinate-derived feasible-region graph for cbse12-math-lp-p1-mcq-011

✅ Step-by-Step Solution

Final Answer: Option (B): (0,8)
  1. The vertex values are 0,15,−2,−14,−28,−32, so (0,8) minimizes Z.

Master Chapter 12: Linear Programming

Practise interactive questions, flashcards, visual mind maps, and timed board tests for Linear Programming.
📘 Chapter Notes & All Exercises 🚀 Open Interactive Workspace →
← Previous Question
Maximize Z=3x+4y subject to x−y≥−1,x≤3,x,y≥0. The maximum is:
Next Question →
A linear objective attains its maximum at two distinct feasible…

More Practice Questions in Linear Programming

Q1Q2Q3Q4Q5Q6Q7Q8Q9Q10Q11Q12Q13Q14Q15Q16Q17Q18Q19Q20Q21Q22Q23Q24Q25Q26Q27Q28Q29Q30Q31Q32Q33Q34Q35Q36Q37Q38Q39Q40

Related Questions in Linear Programming

Class 12 Linear Programming · Mcq Single Correct
How many feasible solutions satisfy 3x+y≤12, x+2y≤10, x,y≥0?
Class 12 Linear Programming · Mcq Single Correct
The shaded first-quadrant region lies above both x+2y=4 and x+y=3. Which constraints describe…
Class 12 Linear Programming · Mcq Single Correct
Z=ax+by has maximum 42 at (4,6) and minimum 19 at (3,2). Find a,b.
Class 12 Linear Programming · Mcq Single Correct
A bounded feasible polygon has vertices (2,72),(15,20),(40,15). For Z=18x+9y, select the…
Class 12 Linear Programming · Mcq Single Correct
How many vertices does x−y≥0, 2y≤x+2, x,y≥0 have?
Class 12 Linear Programming · Mcq Single Correct
A bounded feasible polygon has vertices (0,3),(3,2),(0,5). Find the minimum of Z=11x+7y.