JUST ADDED: JEE Main 2026 (Jan 21) Question Paper with Analysis and Solution Attempt Now →
NEP 2020 Compliant

Competency-Based Assessment Made Simple.

A comprehensive platform for Teachers to create standard question papers and Students to practice Case-Based, Assertion-Reason, and Critical Thinking questions.

866+
Questions
4+
Subjects
100%
NEP Aligned

Generate Papers

Create professional PDF/Word papers with logo, instructions, and mixed question types in minutes.

Start Creating

Question Bank

Explore our repository by Class and Topic. Filter by "Knowledge" or "Competency" levels.

Browse Bank

Self-Regulated Test

For Students. Take timed MCQ tests to check your understanding. Get instant feedback.

Take Test
Pedagogy Shift

Why Competency-Based?

According to NEP 2020, rote learning is out. The focus has shifted to assessing a student's ability to apply concepts in real-life situations.

Case-Based Questions

Questions derived from real-world passages to test analytical skills.

Assertion-Reasoning

Testing the logic behind concepts, not just the definition.

Critical Thinking

Open-ended scenarios that require thinking beyond the textbook.

Marking Scheme
Randomly Fetched Question
Question
Consider the Linear Programming Problem, where the objective function $Z=(x+4y)$ needs to be minimized subject to constraints $2x+y\ge1000$, $x+2y\ge800$, $x,y\ge0$. Draw a neat graph of the feasible region and find the minimum value of Z.
REMEMBER COMPETENCY 3 Marks
Concept Application
50%
Calculation / Logic
50%
Target Level
MEDIUM
Unique Feature

More Than Just an Answer Key

We provide complete AI-Powered Explanations for every question.

REMEMBER COMPETENCY MEDIUM

Q: Consider the Linear Programming Problem, where the objective function $Z=(x+4y)$ needs to be minimized subject to constraints $2x+y\ge1000$, $x+2y\ge800$, $x,y\ge0$. Draw a neat graph of the feasible region and find the minimum value of Z.

Question Analysis & Solution

Detailed Solution

Step 1: Graph the Constraints

First, we need to graph the inequalities $2x+y\ge1000$ and $x+2y\ge800$, along with the non-negativity constraints $x,y\ge0$.

Step 2: Convert Inequalities to Equations

Convert the inequalities to equations to find the boundary lines: $2x+y=1000$ and $x+2y=800$.

Step 3: Find Intercepts

For $2x+y=1000$: If $x=0$, then $y=1000$. Point: $(0, 1000)$ If $y=0$, then $2x=1000 \implies x=500$. Point: $(500, 0)$ For $x+2y=800$: If $x=0$, then $2y=800 \implies y=400$. Point: $(0, 400)$ If $y=0$, then $x=800$. Point: $(800, 0)$

Step 4: Plot the Lines

Plot the lines $2x+y=1000$ and $x+2y=800$ on the graph. Since the inequalities are $\ge$, shade the region above each line.

Step 5: Identify the Feasible Region

The feasible region is the intersection of the shaded regions, which is unbounded. The corner points of the feasible region are the intersection of the lines and the axes.

Step 6: Find the Intersection Point

Solve the system of equations: $2x+y=1000$ $x+2y=800$ Multiply the second equation by 2: $2x+4y=1600$. Subtract the first equation from the modified second equation: $(2x+4y) - (2x+y) = 1600 - 1000$ $3y = 600$ $y = 200$ Substitute $y=200$ into $x+2y=800$: $x+2(200)=800$ $x+400=800$ $x=400$ The intersection point is $(400, 200)$.

Step 7: Identify Corner Points

The corner points of the feasible region are $(0, 1000)$, $(400, 200)$, and $(800, 0)$.

Step 8: Evaluate the Objective Function

Evaluate the objective function $Z=x+4y$ at each corner point: At $(0, 1000)$: $Z = 0 + 4(1000) = 4000$ At $(400, 200)$: $Z = 400 + 4(200) = 400 + 800 = 1200$ At $(800, 0)$: $Z = 800 + 4(0) = 800$

Step 9: Determine the Minimum Value

The minimum value of $Z$ is $800$ at the point $(800, 0)$.

Final Answer: 800

View Full Question Details →