The mathematical technique used for finding the best use of limited resources of a concern in the optimum manner is referred to as
Consider the following statements: Linear programming model can be applied to
1. Line balancing problem
2. Transportation problem
3. Network scheduling
Which of these are correct statements?
Shadow price in linear programming refers to the
The linear programming is used for optimization problems which satisfy the following conditions:
1. Objective function is expressed as a linear function of variables.
2. Resources are unlimited.
3. The decision variables are interrelated and non-negative.
Which of these statements is/are correct?
LP is used for optimization problems having limited resource. Unlimited resources have nothing to do with optimization.
In case of solution of a two variable linear programming problems by graphical method, one constraint line comes parallel to the objective function line. Then the problem will have
Find the maximum value of the objective function z = 4x + 6y where x ≥ 0 and y ≥ 0, subject to the constraints
- x + y ≤ 11
x + y ≤ 27
2x + 5y ≤ 90
At (0,0): z = 4(0) + 6(0) = 0
At (0, 11): z = 4(0)+ 6(11) = 66
At (5, 16): z = 4(5)+ 6(16) = 116
At (15, 12): z = 4(15) + 6(12) = 132
At (27,0): z = 4(27)+ 6(0) = 108
The while solving a LP model graphically, the area bounded by the constraints is called
While solving a LP problem, infeasibility may be removed by
Which one of the following is true in case of simplex method of linear programming?
A feasible solution to an LP problem