Graphical Method Mcqs
1. T
he objective function in Linear Programming is used to
A. Minimize or maximize a quantity
B. Solve quadratic equations
C. Find roots
D. Eliminate variables
Answer: A
2. L
inear Programming problems involve
A. Linear equations and inequalities
B. Quadratic equations
C. Logarithmic equations
D. Trigonometric equations
Answer: A
3. T
he feasible region in LPP is the region which
A. Satisfies all constraints
B. Violates constraints
C. Contains only objective function
D. Contains negative values
Answer: A
4. Solve
aximize
M
Z = 3x + 2y
ubject to
S
x + y ≤ 4
x ≥ 0 , y ≥ 0
orner points
C
(0,0), (4,0), (0,4)
Maximum value of Z is
. 8
A
B. 10
C. 12
D. 14
Answer: C
5. In graphical method, optimal solution occurs at
. Any point
A
B. Midpoint
C. Corner point
D. Interior point
Answer: C
6. Solve
aximize
M
Z = 2x + 3y
ubject to
S
x + y ≤ 5
x ≥ 0 , y ≥ 0
orner points
C
(0,0), (5,0), (0,5)
Maximum value is
. 10
A
B. 12
C. 15
D. 20
Answer: C
7. A feasible solution which maximizes or minimizes objective function is called
. Feasible region
A
B. Optimal solution
C. Constraint
D. Boundary point
Answer: B
8. Solve
aximize
M
Z = 5x + 4y
ubject to
S
x + y ≤ 6
x ≥ 0 , y ≥ 0
orner points
C
(0,0), (6,0), (0,6)
Maximum value is
. 24
A
B. 28
C. 30
D. 32
Answer: C
9. The set of all feasible solutions forms
. Optimal region
A
B. Feasible region
C. Linear region
D. Constraint region
Answer: B
10.In LPP variables are generally
. Negative
A
B. Positive or zero
C. Complex
D. Imaginary
Answer: B
11.Solve
aximize
M
Z = 4x + 3y
ubject to
S
x + y ≤ 4
x ≥ 0 , y ≥ 0
orner points
C
(0,0), (4,0), (0,4)
Maximum value
. 12
A
B. 14
C. 16
D. 18
Answer: C
12.If feasible region is unbounded, optimal solution
. Always exists
A
B. May or may not exist
C. Never exists
D. Always zero
Answer: B
13.Solve
aximize
M
Z = 6x + 2y
ubject to
S
x + y ≤ 5
x ≥ 0 , y ≥ 0
orner points
C
(0,0), (5,0), (0,5)
Maximum value
. 20
A
B. 25
C. 30
D. 35
Answer: C
14.Linear Programming was developed by
. Newton
A
B. George Dantzig
C. Euler
D. Gauss
Answer: B
15.Graphical method can solve LPP with
. Two variables
A
B. Three variables
C. Four variables
D. Many variables
Answer: A
16.Solve
aximize
M
Z = 7x + 3y
ubject to
S
x + y ≤ 4
x ≥ 0 , y ≥ 0
orner points
C
(0,0), (4,0), (0,4)
Maximum value
. 20
A
B. 24
C. 28
D. 30
Answer: C
17.The inequalities in LPP are called
. Variables
A
B. Constraints
C. Objective
D. Functions
Answer: B
18.Solve
aximize
M
Z = 8x + 2y
ubject to
S
x + y ≤ 4
x ≥ 0 , y ≥ 0
Maximum value
. 24
A
B. 28
C. 30
D. 32
Answer: D
19.Corner points are also called
. Extreme points
A
B. Linear points
C. Random points
D. Variable points
Answer: A
20.Solve
aximize
M
Z = 2x + 5y
ubject to
S
x + y ≤ 6
x ≥ 0 , y ≥ 0
Maximum value
. 24
A
B. 26
C. 28
D. 30
Answer: D
21.Objective function must be
. Linear
A
B. Quadratic
C. Polynomial
D. Logarithmic
Answer: A
22.Solve
aximize
M
Z = 9x + y
ubject to
S
x + y ≤ 3
x ≥ 0 , y ≥ 0
Maximum value
. 24
A
B. 26
C. 27
D. 30
Answer: C
23.The feasible region is obtained by
. Plotting constraints
A
B. Plotting objective function
C. Random points
D. Guessing values
Answer: A
24.Solve
aximize
M
Z = 3x + 7y
ubject to
S
x + y ≤ 5
x ≥ 0 , y ≥ 0
Maximum value
. 25
A
B. 30
C. 35
D. 40
Answer: C
25.Simplex method is used when
. Variables are many
A
B. Variables are two
C. No variables
D. One variable
Answer: A
26.Solve
aximize
M
Z = 10x + 2y
ubject to
S
x + y ≤ 4
Maximum Z
. 40
A
B. 32
C. 30
D. 20
Answer: A
27.Non-negativity condition means
. x,y ≥ 0
A
B. x,y ≤ 0
C. x,y = 0
D. x,y negative
Answer: A
28.Solve
aximize
M
Z = 3x + 6y
ubject to
S
x + y ≤ 5
Maximum value
. 15
A
B. 18
C. 24
D. 30
Answer: D
29.The solution that satisfies constraints is
. Feasible solution
A
B. Optimal solution
C. Basic solution
D. Linear solution
Answer: A
30.Solve
aximize
M
Z = 4x + y
ubject to
S
x + y ≤ 3
Maximum value
. 9
A
B. 12
C. 8
D. 7
Answer: B
31.LPP deals with
. Optimization
A
B. Integration
C. Differentiation
D. Limits
Answer: A
32.Solve
aximize
M
Z = 5x + y
ubject to
S
x + y ≤ 3
Maximum
. 15
A
B. 10
C. 12
D. 8
Answer: A
33.The boundary of feasible region is
. Straight lines
A
B. Circles
C. Parabolas
D. Ellipses
Answer: A
34.Solve
aximize
M
Z = 6x + 4y
ubject to
S
x + y ≤ 4
Maximum
. 16
A
B. 24
C. 20
D. 18
Answer: B
35.Graphical solution needs
. Two variables
A
B. Three variables
C. Four variables
D. Five variables
Answer: A
36.Solve
aximize
M
Z = 2x + 9y
ubject to
S
x + y ≤ 3
Maximum
. 27
A
B. 18
C. 21
D. 24
Answer: A
37.The corner point method evaluates
. Objective function at vertices
A
B. Random points
C. Midpoints
D. Slopes only
Answer: A
38.Solve
aximize
M
Z = 8x + y
ubject to
S
x + y ≤ 3
Maximum
. 24
A
B. 18
C. 20
D. 16
Answer: A
39.Constraints restrict
. Feasible region
A
B. Objective function
C. Variables
D. Equations
Answer: A
40.Solve
aximize
M
Z = 3x + 4y
ubject to
S
x + y ≤ 5
Maximum
. 20
A
B. 15
C. 18
D. 17
Answer: A
41.A solution satisfying non-negativity is
. Feasible
A
B. Infeasible
C. Impossible
D. Negative
Answer: A
42.Solve
aximize
M
Z = 7x + 2y
ubject to
S
x + y ≤ 4
Maximum
. 28
A
B. 20
C. 24
D. 26
Answer: A
43.Optimal value occurs at
. Extreme points
A
B. Interior points
C. Random points
D. Midpoints
Answer: A
44.Solve
aximize
M
Z = 4x + 8y
ubject to
S
x + y ≤ 2
Maximum
. 8
A
B. 16
C. 12
D. 10
Answer: B
45.LPP belongs to
. Operations Research
A
B. Algebra
C. Geometry
D. Statistics
Answer: A
46.Solve
aximize
M
Z = 9x + 3y
ubject to
S
x + y ≤ 3
Maximum
. 27
A
B. 18
C. 21
D. 24
Answer: A
47.Constraints can be
. Equations or inequalities
A
B. Only equations
C. Only inequalities
D. None
Answer: A
48.Solve
aximize
M
Z = 6x + 5y
ubject to
S
x + y ≤ 4
Maximum
. 24
A
B. 20
C. 18
D. 22
Answer: A
49.LPP solution region is
. Convex
A
B. Circular
C. Square
D. Random
Answer: A
50.The best feasible solution is
. Optimal solution
A
B. Basic solution
C. Random solution
D. Boundary solution
Answer: A