Scribd
Upload
8 views14 pages

Continuous Internal Assessment (CIA) T

The document outlines an assessment for the MBA238 Management Science course at CHRIST University, focusing on continuous improvement through linear programming problems. It includes various tasks such as maximizing and minimizing objectives, formulating linear programming models, and evaluating solutions graphically. Evaluation criteria are provided, emphasizing clarity in defining decision variables, constraints, and presenting solutions.

Uploaded by

annapoorna3634
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views14 pages

Continuous Internal Assessment (CIA) T

The document outlines an assessment for the MBA238 Management Science course at CHRIST University, focusing on continuous improvement through linear programming problems. It includes various tasks such as maximizing and minimizing objectives, formulating linear programming models, and evaluating solutions graphically. Evaluation criteria are provided, emphasizing clarity in defining decision variables, constraints, and presenting solutions.

Uploaded by

annapoorna3634
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

School of Business and Management

CHRIST (Deemed to be University)

Course Code: MBA238


Course Name: MANAGEMENT SCIENCE

CONTINIOUS IMPROVEMENT ASSISSMENT {CIA-I}

Batch 2024 - 26

Name:

Section:

Roll Number

Register Number

Date of
Submission

RUBRICS FOR EVALUATION: 1) Clearly defines decision variables, objective function, and
constraints. 2) Accurately calculates the optimal solution, including values for the decision variables
and objective function. 3) Uses graphs to visually demonstrate the optimization process where
applicable. 4) Identifies binding and nonbinding constraints and explains their significance.5) Presents
the solution in a clear, organized, and logical manner.
OVER ALL GOOD HANDWRITING

Contents Maximum Marks Marks Obtained


CIA-I 15

SIGNATURE OF STUDENT

Signature of the Staff:

STAFF NAME: Dr.N.SURESH


1
1) Solve the following problem graphically.
Maximize Z = 60x1 + 40x2
Subject to:
2x1+ x2 ≤ 60
x1 ≤ 25
x2 ≤ 35
x1 ≥ 0, x2 ≥ 0

2
2) Solve the following problem graphically.
Minimize Z = 20x1 + 40x2
Subject to:
36x1 + 6x2 ≥ 108
3x1 + 12x2 ≥ 36
20x1 + 10x2 ≥ 100
x1 , x2 ≥ 0

3
3) Write the dual of the following LPP.
Maximize Z = 5x1 + 4x2
Subject to the constraints,
6x1 + 2x2 ≤ 20
2x3 + 4x4 ≤ 50
x1 , x2 , x3 , x4 ≥ 0

4
4) Write the Dual of the following LPP:
Max z =5 x + 7y
Subject to 6x + 7y ≥ 2
4x + 2y ≤ 7
x≤2y≤2
x, y ≥ 0

5
5) A firm is producing two items I1 and I2. Each unit of I1 requires 4 units of
raw material and requires 6 hours of processing time in the machine
department. While the item I2 needs 3 units of raw material and 3 hours in
processing department. The factory has 90 units of raw material as a stock
for the current week and 96 hours in the processing department. The profit
from the sale of I1 and I2 is Rs.60 and Rs.45 respectively. Formulate LPP
model

6
6) Round–the–clock Ltd., a departmental store has the following daily requirement
for staff.
Staff reports to the store at the start of each period & works for 8 consecutive
hours. The departmental store wants to find out the minimal number of staff to be
employed so that there will be sufficient number of employees available for each
period. You are required to formulate the problem as a linear programming model
giving clearly the constraints & the objective function.

Period Time Time ( 24 hrs a day) Minimum staff Requirement1


1 6 am -- 10 am 12
2 10 am – 2 pm 17
3 2 pm – 6 pm 25
4 6 pm – 10 pm 18
5 10 pm – 2 am 20
6 2 am – 6 am 16

7
8
7) An oil refinery can blend three grades of crude oil to produce quality A
and quality B petrol. Two possible blending processes are available. For each
production run, the older process uses 5 units of crude Q, 7 units of crude P and
2 units of crude R and produces 9 units of A and 7 units of B. The newer process
uses 3 units of crude Q, 9 unit of crude P and 4 units of crude R to produce 5
units of A and 9 units of B. Because of prior contract commitments, the refinery
must produce at least 500 units of A and at least 300 units of B for the next
month. It has, 1,500 units of crude Q, 1,900 units of crude P and 1,000 of crude
R. For each unit of A, refinery receives Rs.60 while for each unit of B, it receives
Rs.90. Formulate the problem as linear programming model so as to maximize
the revenue.

9
10
8) A tailor makes dress and suite from three different materials – cotton,
silk, and wool. 16 square meters of cotton, 11 square meters of silk, and 15
square meters of wool are available with him. A dress requires 2 square meters
of cotton, 1square meter of silk, and 1 square meter of wool. A suit requires 1
square meter of cotton, 2 square meters of silk and 3 square meters of wool.
The cost of producing one dress is expected to be Rs. 50 and one suit is Rs.
100. The revenue
expected from one dress is Rs. 80 and one suit is Rs. 150.
a. Formulate the following into an LPP to maximize the profit.
b. Draw a graph to determine the number of units of dress and suits to be made
to optimize profit.
c. Test the optimal profit with the constraints.
d. Determine the binding and nonbinding constraints.

11
12
13
14

You might also like