HomeTestsSearchRankProfile

Linear Programming Questions

Practice 29 Linear Programming questions with detailed answers and explanations. Free MCQs, PYQs, and mock test questions for NEET, JEE, GATE, SSC and more.

📚
29
Total Questions
🟢
0
Easy
🟡
29
Medium
🔴
0
Hard
Practice by Exam:Mathematics(29)

About Linear Programming — practice questions, PYQs & concepts

Linear Programming is a frequently-tested topic on Mathematics. ExamTest.live currently lists 29 Linear Programming questions spanning previous-year papers from 2026 to 2026, each with worked solutions and a step-by-step explanation. Use the filters on this page to focus on a specific exam, difficulty level or year — every answer key is free, no sign-up required.

Linear Programming weight in competitive exams

Across our Linear Programming question bank, the largest sources are Mathematics (29). Click any exam chip above to drill down to that exam-specific question set.

How to use this page

  • Start easy: 0 easy Linear Programming questions are available — build fluency before moving up.
  • Target weak years: Use the year filter to focus on the most recent 2026 paper or older PYQs you have not attempted.
  • Time yourself: Every question shows the average solve time so you can benchmark your speed against other students.
  • Read every explanation: Even on questions you got right — the explanation often surfaces a faster approach you can reuse.

All Linear Programming Questions(1–29 of 29)

Filter:
Q1mediummcqMathematicsMathematics Mock Test - 12026
0% accuracy
Which among the following is not a property of a Linear Programming Problem (LPP)?
Q2mediummcqMathematicsMathematics Mock Test - 102026
9% accuracy
Durgesh is working in a restaurant in which he prepares two types of dishes and . Dish takes 20 minutes to be prepared and Dish takes 30 minutes. He earns Rs 50 to make one packet of dish and Rs 70 for dish . He works for 12 hours a day, using 1 hour for personal activities. What will be the objective function to maximize his earnings? (Let be packets of )
Q3mediummcqMathematicsMathematics Mock Test - 102026
9% accuracy
Consider the objective function subject to , , and . The objective function is maximized:
Q4mediummcqMathematicsMathematics Mock Test - 102026
18% accuracy
Durgesh is working in a restaurant in which he prepares two types of dishes and . Dish takes 20 minutes to be prepared and Dish takes 30 minutes for the same. He earns Rs 50 to make one packet of dish , while Rs 70 for one packet of dish . He works for 12 hours a day, including 1 hour for personal activities. What will be the objective function if this example is formulated as a linear programming problem? Assume and are the packets of dishes and respectively.
Q5mediummcqMathematicsMathematics Mock Test - 12026
0% accuracy
Consider the constraints: Solving by graphical method, which point among the following will not form a boundary/corner point of the feasible region?
Q6mediummcqMathematicsMathematics Mock Test - 52026
50% accuracy
The activities or limitations competing with one another to share the amount of resources in linear programming are called:
Q7mediummcqMathematicsMathematics Mock Test - 52026
50% accuracy
The number of solutions in a linear programming model to maximize subject to , , and will be:
Q8mediummcqMathematicsMathematics Mock Test - 52026
100% accuracy
Durgesh works in a restaurant preparing two types of dishes, A and B. Dish A takes 20 minutes to prepare and Dish B takes 30 minutes. He earns Rs 50 for dish A and Rs 70 for dish B. He works for 12 hours a day and needs 1 hour for personal activities. What will be the time constraint if formulated as a linear programming problem? Assume and are the packets of dishes A and B respectively.
Q9mediummcqMathematicsMathematics Mock Test - 52026
50% accuracy
The maximum value of the objective function subject to , , is:
Q10mediummcqMathematicsMathematics Mock Test - 42026
0% accuracy
Two models, and , of a product earn profits of and per piece, respectively. Production times for and are hours and hours, respectively, while the total production time available is hours. For a total batch size of , the objective function is subjected to the constraints:
Q11mediummcqMathematicsMathematics Mock Test - 22026
0% accuracy
Maximize subject to constraints: Find the optimum units of and to be used.
Q12mediummcqMathematicsMathematics Mock Test - 22026
0% accuracy
Consider the Linear Programming problem:Maximize: subject to: The number of basic solutions is:
Q13mediummcqMathematicsMathematics Mock Test - 22026
0% accuracy
Maximize subject to the following constraints: and the solution is in the first quadrant (). What can be said about the solution of this LPP?
Q14mediummcqMathematicsMathematics Mock Test - 92026
0% accuracy
The minimum value of , subject to the constraints , , , is:
Q15mediummcqMathematicsMathematics Mock Test - 92026
0% accuracy
A manufacturer produces two types of products, 1 and 2, at production levels of and respectively. The profit is . Constraints are , , . The maximum profit is:
Q16mediummcqMathematicsMathematics Mock Test - 42026
0% accuracy
The minimum value of such that: is:
Q17mediummcqMathematicsMathematics Mock Test - 42026
0% accuracy
For the linear programming problem: Subject to: The above problem has:
Q18mediummcqMathematicsMathematics Mock Test - 32026
For a Linear Programming Problem, . Feasible corner points are . What is the optimal maximized value of ?
Q19mediummcqMathematicsMathematics Mock Test - 32026
Maximize subject to , , . The solution to the LPP is:
Q20mediummcqMathematicsMathematics Mock Test - 32026
Ram is a fruit seller. Apples cost Rs 80/kg and Mangoes Rs 120/kg. Profits are Rs 10/kg and Rs 12/kg respectively. Let be kgs of apples and be kgs of mangoes. If Ram wants to maximize profit, the objective function is:
Q21mediummcqMathematicsMathematics Mock Test - 82026
Maximize , subject to , , and . For this LPP:
Q22mediummcqMathematicsMathematics Mock Test - 82026
Shyam needs a minimum of 150 units of carbohydrates and 120 units of proteins. Product A provides 16 units of carbohydrates and 11 units of proteins, while product B provides 10 units of carbohydrates and 20 units of proteins. The cost of product A is and product B is . Formulate this situation as a Linear Programming Problem where and are units of products A and B respectively.
Q23mediummcqMathematicsMathematics Mock Test - 112026
Maximize subject to , , .
Q24mediummcqMathematicsMathematics Mock Test - 112026
An objective function is maximum at points and . If and , then the maximum value of the function is:
Q25mediummcqMathematicsMathematics Mock Test - 112026
Which of the following is one of the feasible solutions for a Linear Programming Problem with constraints: , , , , ?
Q26mediummcqMathematicsMathematics Mock Test - 112026
For an objective function with constraints and (), at what point(s) will achieve its maximum value?
Q27mediummcqMathematicsMathematics Mock Test - 112026
Maximize subject to and (). In the feasible region, the maximum value occurs at:
Q28mediummcqMathematicsMathematics Mock Test - 112026
The point that lies in the region bounded by the lines and is:
Q29mediummcqMathematicsMathematics Mock Test - 112026
Ashok bought tables and chairs for a marriage hall. The cost of a table is and a chair is . He has a budget of and space for at most items. If the profit is per table and per chair, find the maximum profit.

Frequently Asked Questions

How many Linear Programming questions are on ExamTest.live?▼
We have 29 Linear Programming questions spread across 1 pages, covering easy, medium, and hard difficulty levels with detailed explanations.
Are Linear Programming MCQs free?▼
Yes. All Linear Programming questions, answers, and explanations on ExamTest.live are completely free. No account or subscription required.
Which exams include Linear Programming questions?▼
Linear Programming questions are commonly asked in Mathematics. You can filter by exam using the links above.
How do I practice Linear Programming questions effectively?▼
Start with easy questions to build confidence, then tackle medium and hard ones. Use the filter buttons to sort by difficulty. Reveal the answer only after attempting each question, and read the explanation thoroughly.