The maximum value of $Z=3x+2y$ subject to $x+y\le 4$, $x+3y\le 6$, $x\ge 0$, $y\ge 0$ is

Linear Programming — Preparation

This question tests your understanding of Linear Programming, a key topic in the Quantitative Aptitude section. The detailed solution above uses a step-by-step approach to show the reasoning, and where available, a shortcut that helps you solve similar questions in under 90 seconds during the actual exam.

Linear programming (LPP) is a method for finding the best outcome, such as maximum profit or minimum cost, subject to a set of linear constraints. A linear programming problem has an objective function to maximise or minimise, decision variables, and constraints written as linear inequalities, along with the condition that the variables are non-negative. In MHT CET, problems are solved graphically. Draw each constraint as a line, shade the region that satisfies all the inequalities (the feasible region), and find its corner points. The optimal value of the objective function always occurs at one of these corner points, so evaluate the objective function at each one and choose the largest or smallest value. Questions also ask you to form the LPP from a word problem, identify the feasible region from a graph, or recognise when a problem has no feasible solution or an unbounded one. Practise the linear programming questions below, each with a step-by-step graphical solution.