3 JUNNURI MOHAN KARTHIKEYA 2200031604 J2

Dashboard  My courses  MATH-22MT2004 2023-2024 ODD SEMESTER  Mock Test  Mock test -

MATHEMATICAL PROGRAMMING 2023-2024 ODD

SEMESTER Mock test -

Started on Wednesday, 15 November 2023, 9:43 PM

State Finished
Completed on Friday, 17 November 2023, 5:16 PM
Time taken 1 day 19 hours
Grade 39.00 out of 40.00 (97.5%)

Question 1 Correct Mark 1.00 out of 1.00

Which of the following is a KKT (Karush-Kuhn-Tucker) condition for a constrained optimization

problem?

a. Lagrange Condition
b. Second-Order Optimality Condition
c. Cauchy-Point Condition
d. First-Order Optimality Condition

The correct answer is: First-Order Optimality Condition

Question 2 Correct Mark 1.00 out of 1.00

In quadratic programming, what is the key characteristic that distinguishes it from linear
programming?

a. Quadratic programming does not involve optimization.

b. Quadratic programming can only have linear constraints.
c. Quadratic programming problems always have a unique global solution.
d. Quadratic programming deals with quadratic objective functions.

The correct answer is: Quadratic programming deals with quadratic objective functions.

Question 3 Correct Mark 1.00 out of 1.00

In a Linear Programming Problem (LPP), the objective function is always:

a. Equal to zero
b. Maximize
c. Minimize
d. Irrelevant

The correct answer is: Minimize

Question 4 Correct Mark 1.00 out of 1.00

A bakery produces two types of cakes, Cake A and Cake B. It takes 2 hours and 3 hours to bake one
Cake A and Cake B, respectively. The bakery has 20 hours of baking time available. Cake A sells for
$20, while Cake B sells for $25. The bakery needs to produce at least 5 Cake A and 4 Cake B. How
many Cake A and Cake B should the bakery produce to maximize revenue? Formulate the LPP.

a. Cake A: 3 units, Cake B: 5 units

b. Cake A: 6 units, Cake B: 2 units
c. Cake A: 5 units, Cake B: 3 units
d. Cake A: 4 units, Cake B: 4 units

The correct answer is: Cake A: 4 units, Cake B: 4 units

Question 5 Correct Mark 1.00 out of 1.00

Duality Principle is used for

a. To increase complexity the problem

b. None of the above
c. To differentiate
d. Converting a given optimization problem having more constraints to a problem with less
constraints

The correct answer is: Converting a given optimization problem having more constraints to a problem
with less constraints

Question 6 Correct Mark 1.00 out of 1.00

In wolf method

a. Qp problem is transformed to LP and solved using simplex method

b. Both and b are correct
c. None of the above
d. QP problem is transformed t o geometric programming and solve

The correct answer is: Qp problem is transformed to LP and solved using simplex method

Question 7 Correct Mark 1.00 out of 1.00

Which among the following is not a method to solve linear programming problem?

a. KKT conditions
b. Simplex method
c. All the above
d. Graphical method

The correct answer is: Simplex method

Question 8 Correct Mark 1.00 out of 1.00

What is Geometric Programming (GP)?

a. A type of optimization problem with a specific form

b. A programming language for geometry
c. A method for solving linear equations
d. A graphics rendering technique

The correct answer is: A type of optimization problem with a specific form

Question 9 Correct Mark 1.00 out of 1.00

Consider the following Linear Programming problem: Maximize Z = 5x + 3y, 2x + 3y ≤ 10, x + y ≤ 6,x,
y ≥ 0 What is the optimal solution for maximizing Z?

a. Z = 26 at x = 4, y = 2
b. Z = 20 at x = 2, y = 4
c. Z = 23 at x = 3, y = 2
d. Z = 18 at x = 5, y = 3

The correct answer is: Z = 26 at x = 4, y = 2

Question 10 Correct Mark 1.00 out of 1.00

A furniture manufacturer produces two types of tables, Table X and Table Y. It takes 4 hours and 5
hours to produce one Table X and Table Y, respectively. The manufacturer has 40 hours of
production time available. Table X brings a profit of $300, while Table Y brings a profit of $400. The
manufacturer needs to produce at least 6 units of Table X and 4 units of Table Y. How many units of
Table X and Table Y should the manufacturer produce to maximize profit? Formulate the LPP.

a. Table X: 4 units, Table Y: 6 units

b. Table X: 6 units, Table Y: 4 units
c. Table X: 7 units, Table Y: 3 units
d. Table X: 5 units, Table Y: 5 units

The correct answer is: Table X: 4 units, Table Y: 6 units

Question 11 Correct Mark 1.00 out of 1.00

Consider the following Linear Programming problem:Minimize Z = 2x + 3y , Subject to: x + y ≥ 5 , 2x

+ y ≤ 10 , x, y ≥ 0 ,What is the minimum value of Z?

a. 7
b. 5
c. 8
d. 10

The correct answer is: 8

Question 12 Correct Mark 1.00 out of 1.00

Which of the following is not a characteristic of the graphical method?

a. It is an iterative process
b. It is only applicable to two-variable problems
c. It can handle a large number of variables
d. It provides a visual representation of the problem

The correct answer is: It can handle a large number of variables

Question 13 Correct Mark 1.00 out of 1.00

The feasible region in linear programming represents:

a. The region satisfying all constraints

b. The region where the objective function is maximized
c. The region where the objective function is minimized
d. The region outside the constraints

The correct answer is: The region satisfying all constraints

Question 14 Correct Mark 1.00 out of 1.00

A company produces two products, X and Y. The profit per unit of X is $5, and the profit per unit of
Y is $8. The company wants to maximize its profit. The feasible region formed by the constraints is
a triangle with vertices at (0, 0), (0, 6), and (8, 0). What is the optimal solution for maximizing profit?

a. X = 2, Y = 4
b. X = 4, Y = 2
c. X = 3, Y = 3
d. X = 6, Y = 0

The correct answer is: X = 4, Y = 2

Question 15 Correct Mark 1.00 out of 1.00

In the simplex method, the initial feasible solution is found at:

a. The origin (0,0)

b. The intersection of the constraints
c. The global minimum point
d. The global maximum point

The correct answer is: The intersection of the constraints

Question 16 Correct Mark 1.00 out of 1.00

Which of the following is a KKT (Karush-Kuhn-Tucker) condition for a constrained optimization

problem?

a. First-Order Optimality Condition

b. Cauchy-Point Condition
c. Second-Order Optimality Condition
d. Lagrange Condition

The correct answer is: First-Order Optimality Condition

Question 17 Correct Mark 1.00 out of 1.00

Duality Principle is used for

a. To differentiate
b. To increase complexity the problem
c. Converting a given optimization problem having more constraints to a problem with less
constraints
d. None of the above

The correct answer is: Converting a given optimization problem having more constraints to a problem
with less constraints
Question 18 Correct Mark 1.00 out of 1.00

A farmer wants to plant two crops, A and B, in his field. Crop A requires 4 units of fertilizer and 6
units of water per acre, while crop B requires 6 units of fertilizer and 2 units of water per acre. The
farmer has 20 units of fertilizer and 24 units of water available. If the profit per acre for crop A is
$500 and for crop B is $800, what combination of crops should the farmer plant to maximize profit?

a. Crop A: 3 acres, Crop B: 2 acres

b. Crop A: 1 acre, Crop B: 4 acres
c. Crop A: 4 acres, Crop B: 1 acre
d. Crop A: 2 acres, Crop B: 3 acres

The correct answer is: Crop A: 2 acres, Crop B: 3 acres

Question 19 Correct Mark 1.00 out of 1.00

Consider the following Linear Programming problem: Maximize Z = 4x + 3y ,Subject to: 2x + y ≤ 10, x
+ 2y ≤ 8 ,x, y ≥ 0 ,What is the optimal solution for maximizing Z?

a. Z = 20 at x = 5, y = 3
b. Z = 26 at x = 3, y = 2
c. Z = 32 at x = 4, y = 2
d. Z = 24 at x = 2, y = 4

The correct answer is: Z = 32 at x = 4, y = 2

Question 20 Correct Mark 1.00 out of 1.00

What is Geometric Programming (GP)?

a. A method for solving linear equations

b. A type of optimization problem with a specific form
c. A graphics rendering technique
d. A programming language for geometry

The correct answer is: A type of optimization problem with a specific form
Question 21 Correct Mark 1.00 out of 1.00

What is the purpose of the graphical method in linear programming?

a. To plot graphs of variables

b. To solve non-linear equations
c. To find the feasible region
d. To find the global maximum of the objective function

The correct answer is: To find the feasible region

Question 22 Correct Mark 1.00 out of 1.00

Which among the following optimization problems can be solved using KKT conditions

a. Linear Programming
b. Quadratic programming
c. Semi definite programming
d. Geometric programming

The correct answer is: Quadratic programming

Question 23 Correct Mark 1.00 out of 1.00

Consider the following Linear Programming problem: Maximize Z = 3x + 4y Subject to: 2x + y ≤ 10 , x

+ 2y ≤ 8 ,What is the maximum value of Z?

a. 24
b. 22
c. 20
d. 18

The correct answer is: 20

Question 24 Correct Mark 1.00 out of 1.00

Consider the following Linear Programming problem: Maximize Z = 5x + 3y, 2x + 3y ≤ 10, x + y ≤ 6,x,
y ≥ 0 What is the optimal solution for maximizing Z?

a. Z = 23 at x = 3, y = 2
b. Z = 26 at x = 4, y = 2
c. Z = 18 at x = 5, y = 3
d. Z = 20 at x = 2, y = 4

The correct answer is: Z = 26 at x = 4, y = 2

Question 25 Correct Mark 1.00 out of 1.00

The graphical method is used to solve:

a. Exponential equations
b. Non-linear equations
c. Quadratic equations
d. Linear equations

The correct answer is: Linear equations

Question 26 Correct Mark 1.00 out of 1.00

In Wolf method

a. Only first derivative is required

b. Lagrangean function need not be derived
c. Lagrangean functions have to be derived first
d. None of the above

The correct answer is: Lagrangean functions have to be derived first

Question 27 Correct Mark 1.00 out of 1.00

Which of the following is not a characteristic of the graphical method?

a. It provides a visual representation of the problem

b. It is an iterative process
c. It can handle a large number of variables
d. It is only applicable to two-variable problems

The correct answer is: It can handle a large number of variables

Question 28 Correct Mark 1.00 out of 1.00

Which among the following is true for Integer Linear Programming

a. None of the above

b. Optimal solution does not exist
c. Optimal solution are constrained to be fractions
d. Optimal solution is constrained to be integers

The correct answer is: Optimal solution is constrained to be integers

Question 29 Correct Mark 1.00 out of 1.00

Which type of programming problem does Beale's original method primarily address?

a. Quadratic Programming Problem (QP)

b. Nonlinear Programming Problem (NLP)
c. Integer Programming Problem (IP)
d. Linear Programming Problem (LP)

The correct answer is: Quadratic Programming Problem (QP)

Question 30 Correct Mark 1.00 out of 1.00

A company produces two types of cars, Car X and Car Y. It takes 8 hours and 6 hours to produce
one unit of Car X and Car Y, respectively. The company has 48 hours of production time available.
Car X brings a profit of $5000 per unit, while Car Y brings a profit of $6000 per unit. The company
needs to produce at least 3 units of Car X and 4 units of Car Y. How many units of Car X and Car Y
should the company produce to maximize profit? Formulate the LPP.

a. Car X: 4 units, Car Y: 3 units

b. Car X: 2 units, Car Y: 6 units
c. Car X: 3 units, Car Y: 4 units
d. Car X: 6 units, Car Y: 2 units

The correct answer is: Car X: 3 units, Car Y: 4 units

Question 31 Correct Mark 1.00 out of 1.00

The simplex method terminates when:

a. The optimal solution is reached

b. The constraints become infeasible
c. The objective function becomes negative
d. The objective function becomes zero

The correct answer is: The optimal solution is reached

Question 32 Correct Mark 1.00 out of 1.00

Which among the following is true for linear programming optimization problem

a. Objective function can be quadratic

b. Only constraints can be quadratic
c. Both objective function and constraints are linear
d. Both objective function and constraints are non-linear

The correct answer is: Both objective function and constraints are linear
Question 33 Correct Mark 1.00 out of 1.00

A company produces two products, X and Y. The profit per unit of X is $10, and the profit per unit of
Y is $15. The constraints are:3x + 4y ≤ 24 , x + 2y ≤ 8 What is the feasible region in the xy-plane?

a. A quadrilateral with vertices at (0, 0), (6, 0), (4, 6), and (0, 8)
b. A line segment connecting (0, 0) and (8, 0)
c. A triangle with vertices at (0, 0), (0, 8), and (6, 0)
d. A rectangle with vertices at (0, 0), (6, 0), (6, 4), and (0, 8)

The correct answer is: A triangle with vertices at (0, 0), (0, 8), and (6, 0)

Question 34 Incorrect Mark 0.00 out of 1.00

Which among the following is true for linear programming optimization problem

a. Both objective function and constraints are linear

b. Both objective function and constraints are non-linear
c. Only constraints can be quadratic
d. Objective function can be quadratic

The correct answer is: Both objective function and constraints are linear
Question 35 Correct Mark 1.00 out of 1.00

A clothing manufacturer has two factories, Factory A and Factory B. Factory A can produce 100
shirts and 50 pants per day, while Factory B can produce 80 shirts and 70 pants per day. The
production costs at Factory A are $10 per shirt and $12 per pant, while at Factory B they are $12
per shirt and $10 per pant. The company needs to produce at least 300 shirts and 200 pants per
day. How many shirts and pants should be produced at each factory to meet the production
requirement most economically? Formulate the LPP.

a. Factory A: 0 shirts, 200 pants; Factory B: 300 shirts, 0 pants

b. Factory A: 150 shirts, 50 pants; Factory B: 150 shirts, 150 pants
c. Factory A: 100 shirts, 100 pants; Factory B: 200 shirts, 100 pants
d. Factory A: 200 shirts, 0 pants; Factory B: 100 shirts, 200 pants

The correct answer is: Factory A: 150 shirts, 50 pants; Factory B: 150 shirts, 150 pants

Question 36 Correct Mark 1.00 out of 1.00

In quadratic programming, what is the key characteristic that distinguishes it from linear
programming?

a. Quadratic programming does not involve optimization.

b. Quadratic programming can only have linear constraints.
c. Quadratic programming deals with quadratic objective functions.
d. Quadratic programming problems always have a unique global solution.

The correct answer is: Quadratic programming deals with quadratic objective functions.
Question 37 Correct Mark 1.00 out of 1.00

A farmer wants to plant two crops, A and B, in his field. Crop A requires 4 units of fertilizer and 6
units of water per acre, while crop B requires 6 units of fertilizer and 2 units of water per acre. The
farmer has 20 units of fertilizer and 24 units of water available. If the profit per acre for crop A is
$500 and for crop B is $800, what combination of crops should the farmer plant to maximize profit?

a. Crop A: 3 acres, Crop B: 2 acres

b. Crop A: 2 acres, Crop B: 3 acres
c. Crop A: 4 acres, Crop B: 1 acre
d. Crop A: 1 acre, Crop B: 4 acres

The correct answer is: Crop A: 2 acres, Crop B: 3 acres

Question 38 Correct Mark 1.00 out of 1.00

A clothing manufacturer has two factories, Factory A and Factory B. Factory A can produce 100
shirts and 50 pants per day, while Factory B can produce 80 shirts and 70 pants per day. The
production costs at Factory A are $10 per shirt and $12 per pant, while at Factory B they are $12
per shirt and $10 per pant. The company needs to produce at least 300 shirts and 200 pants per
day. How many shirts and pants should be produced at each factory to meet the production
requirement most economically? Formulate the LPP.

a. Factory A: 150 shirts, 50 pants; Factory B: 150 shirts, 150 pants

b. Factory A: 100 shirts, 100 pants; Factory B: 200 shirts, 100 pants
c. Factory A: 200 shirts, 0 pants; Factory B: 100 shirts, 200 pants
d. Factory A: 0 shirts, 200 pants; Factory B: 300 shirts, 0 pants

The correct answer is: Factory A: 150 shirts, 50 pants; Factory B: 150 shirts, 150 pants
Question 39 Correct Mark 1.00 out of 1.00

Whati is the first step in finding the solution of quadratic programming problem using KKT
condition

a. By drawing the feasible regions

b. Taking first derivative of the problem
c. Taking second derivative of the objective function
d. Deriving lagrangean function

The correct answer is: Deriving lagrangean function

Question 40 Correct Mark 1.00 out of 1.00

A company produces two products, X and Y. The profit per unit of X is $5, and the profit per unit of
Y is $8. The company wants to maximize its profit. The feasible region formed by the constraints is
a triangle with vertices at (0, 0), (0, 6), and (8, 0). What is the optimal solution for maximizing profit?

a. X = 3, Y = 3
b. X = 6, Y = 0
c. X = 2, Y = 4
d. X = 4, Y = 2

The correct answer is: X = 4, Y = 2

◄ Answer Key for Sem-in-1 Jump to...

session 1 ►