Linear Programming and Optimization
Formulation
Solved Example: 9131-01
As per one of the assumptions of linear programming problem in operation research, objective function and constraints are assumed to be: (UPRVUNL AE ME July 2021)
A. Sinusoidal
B. Exponential
C. Linear
D. Circular
Correct Answer: C
Solved Example: 9131-02
In a Linear Programming problem, the restrictions or limitations under which the objective function is to be optimised are called: (TNTRB 2017 ME)
A. Constraints
B. Objective function
C. Decision variables
D. None of the above
Correct Answer: A
Solved Example: 9131-03
In a Linear Programming Problem, the linear relations of the variables which are either to be maximized or minimized is called: (MP Sub Engg Civil Dec 2020 - Shift II)
A. The decisions variables
B. The constraints functions
C. The variable function
D. The objective function
Correct Answer: D
Solved Example: 9131-04
In a transportation problem with 4 supply points and 5 demand points, how many number of constraints are required in its formulation? (BHEL ET Mech May 2019)
A. 20
B. 1
C. 0
D. 9
Correct Answer: D
Solved Example: 9131-05
Any linear programming model must have all of the following properties EXCEPT: (UPRVUNL AE ME Shift I Jul 2022)
A. The model must have structural constraints
B. The relationship between variables and constraints must be non-linear
C. The model must have an objective function
D. The model must have non-negativity constraint
Correct Answer: B
Solution
Solved Example: 9132-01
Consider the Linear Programming problem:
\[7X_1+ 6X_2 + 4X_3\]subject to:
\[X_1 + X_2 + X_3 \leq 5\] \[2X_1 + X_2 + 3X_3 \leq 10\] \[X_1 , X_2 , X_3 \geq 0\] (Solve by algebraic method).The number of basic solutions is:
(BHEL ET Mech May 2019)A. 10
B. 7
C. 9
D. 8
Correct Answer: A
Solved Example: 9132-02
The graphical method is best suited for solving linear programming problems with _____ variables. (UPRVUNL AE ME Jul 2021)
A. 5
B. 3
C. 4
D. 2
Correct Answer: D
Solved Example: 9132-03
Consider the given problem:
5x + y ≤ 100 ... (1)
x + y ≤ 60 ... (2)
x ≥ 0 ... (3)
y ≥ 0 ... (4)
If we solve the above linear equations by the graphical method of Linear Programming, then the following point ____ will not form the the boundary of the feasible region.
(MP Vyapam Sub Eng Sep 2018 shift I Mech)A. (60, 0)
B. (20, 0)
C. (0, 60)
D. (10, 50)
Correct Answer: A
Interpretation
Solved Example: 9136-01
What is the interpretation of the shaded region in a Linear Programming Problems? (MP Sub Civil Dec 2020 Shift I)
A. It is very important area
B. It will not satisfy the limitations
C. It will satisfy few constraints
D. It will satisfy all constraints
Correct Answer: D