Mechanical Engineering Exam  >  Mechanical Engineering Tests  >  Industrial Engineering  >  Test: Linear Programming Level - 3 - Mechanical Engineering MCQ

Test: Linear Programming Level - 3 - Mechanical Engineering MCQ


Test Description

14 Questions MCQ Test Industrial Engineering - Test: Linear Programming Level - 3

Test: Linear Programming Level - 3 for Mechanical Engineering 2024 is part of Industrial Engineering preparation. The Test: Linear Programming Level - 3 questions and answers have been prepared according to the Mechanical Engineering exam syllabus.The Test: Linear Programming Level - 3 MCQs are made for Mechanical Engineering 2024 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: Linear Programming Level - 3 below.
Solutions of Test: Linear Programming Level - 3 questions in English are available as part of our Industrial Engineering for Mechanical Engineering & Test: Linear Programming Level - 3 solutions in Hindi for Industrial Engineering course. Download more important topics, notes, lectures and mock test series for Mechanical Engineering Exam by signing up for free. Attempt Test: Linear Programming Level - 3 | 14 questions in 45 minutes | Mock test for Mechanical Engineering preparation | Free important questions MCQ to study Industrial Engineering for Mechanical Engineering Exam | Download free PDF with solutions
*Answer can only contain numeric values
Test: Linear Programming Level - 3 - Question 1

Max z = 40x1 + 60x2

s/t: 2x + y ≤ 90

x + y ≤ 50

x + 2y ≤ 80

x, y ≥ 0

Find the value of zmax


Detailed Solution for Test: Linear Programming Level - 3 - Question 1

zA = (0, 1) = 2

zB = (0, 2) = 4∗

zC = (2, 3) = 4∗

Test: Linear Programming Level - 3 - Question 2

Solve the following LPP and identify the type of solution

Max z = 3x1 + 4x2

s/t: x1 − x2 ≥ 0

2.5x1 − x2 ≤ −3

x1 , x2 ≥ 0

Detailed Solution for Test: Linear Programming Level - 3 - Question 2

No feasible region

1 Crore+ students have signed up on EduRev. Have you? Download the App
*Answer can only contain numeric values
Test: Linear Programming Level - 3 - Question 3

A company produces cups and trays by deep drawing and forming operations. Following data is given on capacity availability and economics of each product.

The profit on each cup and tray is given as Rs.40 and Rs.80 respectively. Total daily fixed cost is Rs.90, 000. The maximum net profit per day at the optimum production level is ____________ Rs. [Consider the effect of fixed cost also]


Detailed Solution for Test: Linear Programming Level - 3 - Question 3

Let no. of cups = x

No. of trays = y

Fixed cost = 90,000

Max z = 40x + 80y − 90000

For deep drawing machine 20x + 40y ≤ 60,000

For forming machine 30x + 10y ≤ 60,000

z(0,0) = 0

z(0,1500) = 30,000

z(1800,600) = 30, 000

z(2000,0) = −10,000

Test: Linear Programming Level - 3 - Question 4

Consider the following LPP

Max z = 2x1 + 10x2

s/t: 3x1 + 2x2 ≤ 4

5x1 + 3x2 ≤ 6

x1 + x2 ≤ 10

The solution for the above LPP is

Detailed Solution for Test: Linear Programming Level - 3 - Question 4

Given,

Max z = 2x1 + 10x2

x1 + x2 , ≤ 10; (0, 10)(10, 0)

z(0,0) = 0

z(0,2) = 20∗

z(6/5,0) = 2.4

i) One of the decision variable is zero

ii) There is a redundant constraint present but fully consumed. 3x1 + 2x2 + s1 = 4; s1 = 0

Test: Linear Programming Level - 3 - Question 5

Consider the following LPP

Minimize z = 5x1 + 7x2 + x3

s/t: 2x1 − x2 + 4x3 ≤ 10

x1 , x2 , x3 ≥ 0

The solution for the above LPP is

Detailed Solution for Test: Linear Programming Level - 3 - Question 5

Standard form:

z − 5x1 − 7x2 − x3 = 0

2x1 − x2 + 4x3 + s1 = 10

Test: Linear Programming Level - 3 - Question 6

Consider the following primal LPP. Find dual of the given primal.

Max: z = 4x1 + 2x2 + 6x3

s/t: 2x1 + 3x2 + 2x3 ≥ 6

3x1 + 4x2 ≤ 8

6x1 − 4x2 + x3 ≤ 10

s/ t: 2y1 + 3y2 + 6y3 ≥ 4

3y1 + 4y2 − 4y3 ≥ 2

2y1 + y3 ≥ 6

y1 , y2, y3 ≥ 0

s/t: − 2y1 + 3y2 + 6y3 ≥ 4

−3y1 + 4y2 − 4y3 ≥ 2

−2y1 + y3 ≥ 6

y1 , y2, y3 ≥ 0

2y1 + 3y2 + 6y3 ≤ 4

3y1 + 4y2 − 4y3 ≤ 2

2y1 + y3 ≤ 6

y1 , y2, y3 ≥ 0

s/t: − 2y1 + 3y2 + 6y3 ≤ 4

−3y1 + 4y2 − 4y3 ≤ 2

−2y1 + y3 ≤ 6

y1 , y2, y3 ≥ 0

Detailed Solution for Test: Linear Programming Level - 3 - Question 6

zmax = 4x1 + 2x2 + 6x3

s/t: 2x1 + 3x2 + 2x3 ≥ 6

−2x1 − 3x2 − 2x3 ≤ −6

3x1 + 4x2 ≤ 8

6x1 − 4x2 + x3 ≤ 10

Dual:

Min: w = −6y1 + 8y2 + 10y3

s/t: − 2y1 + 3y2 + 6y3 ≥ 4

−3y1 + 4y2 − 4y3 ≥ 2

−2y1 + y3 ≥ 6

y1 , y2 , y3 ≥ 0

Test: Linear Programming Level - 3 - Question 7

Find the initial basic feasible solution using VAM method.

Detailed Solution for Test: Linear Programming Level - 3 - Question 7

TC = 18 × 100 + 150 × 16 + 150 × 16 + 16× 100 + 15 × 50 + 125 × 13 + 14 × 75

= 11, 625 Rs.

Test: Linear Programming Level - 3 - Question 8

A product is manufactured using two raw materials A and B. A is taken on x-axis and B is taken on Y-axis and the LPP is as follows.

Zmin = 2A + 3B

S⁄t ∶ 0.6 A + 0.3 B ≥ 45

0.1 A + 0.5B ≥ 25

A, B ≥ 0

Which of the following statement is correct?

*Answer can only contain numeric values
Test: Linear Programming Level - 3 - Question 9

Four workers are required to do four jobs. Time to complete every job is given in the table below

Find the minimum cost.


Detailed Solution for Test: Linear Programming Level - 3 - Question 9

Row Reduction:

Column Reduction:

Using straight line method:

TC = 1 + 10 + 5 + 5 = 21

*Answer can only contain numeric values
Test: Linear Programming Level - 3 - Question 10

Find optimal assignment cost.


Detailed Solution for Test: Linear Programming Level - 3 - Question 10

Row Reduction:

Column Reduction:

It has multiple solutions TC = 10 + 7 + 8 + 10 = 35

*Answer can only contain numeric values
Test: Linear Programming Level - 3 - Question 11

Consider the following profit matrix. Find the max profit


Detailed Solution for Test: Linear Programming Level - 3 - Question 11

Row Reduction

Column Reduction

Use straight line method

Total cost = 4 + 3 + 2 + 2 + 2 = 13

*Answer can only contain numeric values
Test: Linear Programming Level - 3 - Question 12

Consider the problem of assigning four sales persons to four different sales regions as given below. Find the maximum total sales?

All the values are given in thousands.


Detailed Solution for Test: Linear Programming Level - 3 - Question 12

The given problem is maximization problem. Hungarian algorithm is applicable to only minimization problem so, convert the problem into minimization by subtracting all the elements from max element.

Max element is ‘25’

Loss matrix:

i) Row Reduction:

ii) Column Reduction:

Total sales = 23 + 23 + 25 + 21 = 92

*Answer can only contain numeric values
Test: Linear Programming Level - 3 - Question 13

Consider the following problem A cost matrix is given, find the minimum total cost


Detailed Solution for Test: Linear Programming Level - 3 - Question 13

i) Row Reduction:

ii) Column Reduction:

No zero available for allocation ⇒ use straight line method.

TC = 28 + 29 + 28 + 23 + 40 = 148

*Answer can only contain numeric values
Test: Linear Programming Level - 3 - Question 14

Three workers (P, Q, R) are assigned to 3 machines (M1 , M2 , M3 ) while operator Q cannot be assigned machine M2 . Further, each operator is assigned to one machine and one machine requires only one operator. The operating cost is given for these operators in table below (in Rs). The minimum cost of assignment is ___________ (Rs).


Detailed Solution for Test: Linear Programming Level - 3 - Question 14

Row Reduction

Column Reduction

Use straight line method:

Total minimum cost = 22 + 40 + 25 = 87

30 videos|40 docs|30 tests
Information about Test: Linear Programming Level - 3 Page
In this test you can find the Exam questions for Test: Linear Programming Level - 3 solved & explained in the simplest way possible. Besides giving Questions and answers for Test: Linear Programming Level - 3, EduRev gives you an ample number of Online tests for practice

Top Courses for Mechanical Engineering

30 videos|40 docs|30 tests
Download as PDF

Top Courses for Mechanical Engineering