EASY
Earn 100

The linear function z=ax+by, where a and b are constants x and y are decision variables, which is to maximised or minimised is called an function

50% studentsanswered this correctly

Important Questions on Linear Programming

MEDIUM
The corner points of the feasible region determined by the system of linear constraints are (0,10),(5,5),(15,15),(5,25). Let z=px+qy, where p,q>0. The condition on p and q so that the maximum of z occurs at both points (15,15) and (5,25) is 
EASY
For an LPP  problem the objective function z=3x+2y the coordinates of the corner points the bounded feasible region are A(3,3),B(20,3),C(20,10),D(18,12) and E(12,12) the minimum value of z is
EASY
The vertices of the feasible region determined by some linear constraints are 0,2,1,1,3,3,1,5. Let Z=px+qy, where p,q>0. The condition on p and q so that the maximum of Z occurs at both the points 3,3 and 1,5 is _____.
EASY
Define objective function in Linear Programming Problem.
EASY

Zahida has 31 days to stitch clothes for a showroom. The blue designs can be sewn at a rate of 4 units per day while the white ones at a rate of 7 units per day. The clothes can be up to 96 units total. The cost for her to do the blue design is Rs. 80 per unit and that of the white one is Rs. 120 per unit. Which one of the following can be the linear programming problem to minimize the cost Z for the blue and white design clothes sewn by her for the showroom?

[b= number of units of blue designs,

w= Number of units of white designs]

EASY
The objective function of linear programming problem is _____.
EASY
If the vertices of the feasible region are O0,0, A10,0, B0,20, C15,15, then the minimum value of the objective function Z=10x-20y+30 is
MEDIUM
The corner points of the feasible region determined by the system of linear inequalities are (0,0),(4,0),(2,4) and (0,5). If the maximum value of z=ax+by, where ,a,b>0 occurs at both (2,4) and (4,0), then
EASY

Write the differences between compiler and interpreter.

MEDIUM
A manufacturer produces nuts and bolts. It takes 1 hour of work on Machine A and 3 hours on Machine B to produce a package of nuts. It take 3 hours on Machine A and 1 hour on Machine B to produce a package of bolts. He earns a profit of 17.50 per package on nuts and 7.00 per package on bolts. Formulate the above LPP if the machines operates for at most 12 hours a day.
MEDIUM

The shaded region in the figure is the solution set of the inequations

Question Image 

EASY
The common region determined by all the constraints including the non-negative constraints x0, y0 of a linear programming problem is called_____ for the problem.
EASY
Any point outside the feasible region is the feasible solution.
MEDIUM
An aeroplane can carry a maximum of 250 passengers. A profit of 800 is made on each executive class ticket and a profit of 500 is made on each economy class ticket. The airline reserves at least 25 seats for executive class. However, at least 4 times as many passengers prefer to travel by economy class than by executive class. Determine how many tickets of each type must be sold in order to maximize the profit for the airline. What is the maximum profit?
EASY
The feasible region of a Linear Programming Problem is convex polygon.
EASY
The corner points of the feasible region determined by the system of linear constraints are 0,10, 5,5, 15,15, 0,20. Let z=px+qy, where p, q>0. Condition on p and q, so that the maximum of z occurs at both the points 15,15 and 0,20, is
HARD
Lakshmi wants to buy few bangles and ear drops. Each bangle costs Rs.5 and each ear drop costs Rs.10. She should buy atleast 6 bangles and atmost 2 ear drops. If she buys x bangles and y ear drops with minimum expenditure, then the formulation for this linear programming is
EASY
The objective function of LPP defined over the convex set attains its optimum value at