N=ifr 'kkgwth egkjkt fo'ofo|ky;] dkuiqj – 208024

¼iwoZorhZ dkuiqj fo’ofo|ky;, dkuiqj½

Chhatrapati Shahuji Maharaj University
Kanpur -208024
(Formerly Kanpur University, Kanpur)

COURSE FILE
School : School of Engineering

Department : Mechanical Engineering

Program Name: Engineering

Program Level: UG
(Diploma/ UG/PG/ etc.)
Professional General CBCS Entrepreneurship Employability Skill
Program Attribute: focused oriented focused
Write yes for appropriate Yes Yes
Year/Semester: 2023 / 8th
Course/ subject Name Operations Research
Course Code: MEE – S504
Course Type (Theory/ Theory
Lab/ Seminar/ Training/
Skill/ Project etc.)
Credits 4
Core Elective other Entrepreneurship Employability Skill
Course Attribute: department focused oriented Focused
Write yes for appropriate yes yes
Name of Faculty : Vikash Katiyar

Faculty Code : E-923

Chhatrapati Shahu Ji Maharaj University (Formerly Kanpur University), Kanpur. Page 1

 Course Specification Details
School: School of Engineering
Department: Mechanical Engineering
Name of Program: Engineering
Program Outcomes (PO)
PO1 Engineering knowledge: Apply knowledge of mathematics, science and engineering to analyze,
design and evaluate mechanical components & systems using state -of-the-art IT tools.

PO2 Problem analysis: Analyze problems of mechanical engineering including thermal, manufacturing
and industrial systems to formulate design requirements.

PO3 Design/development of solutions: Design, implement, and evaluate mechanical systems and
processes considering public health, safety, cultural, societal and environmental issues.

PO4 Conduct investigations of complex problems: Design and conduct experiments using domain
knowledge and analyze data to arrive at valid conclusions.

PO5 Modern tool usage: Apply current techniques, skills, knowledge and computer-based methods &
tools to develop mechanical systems, understanding of the limitations.

PO6 The engineer and society: Analyze the local and global impact of modern technologies on
individual organizations, society and culture and professional engineering practice.

PO7 Environment and sustainability: Apply knowledge of contemporary issues to investigate and solve
problems with a concern for sustainability and ecofriendly environment.
PO8 Ethics: Apply ethical principles and commit to professional ethics and legal responsibilities and
social norms of the engineering practice.
PO9 Individual and team work: Function effectively as an individual, and as a member or leader in
diverse teams, and in multidisciplinary settings.
PO10 Communication: Communicate effectively in diverse groups and exhibit leadership qualities, to
comprehend and write effective reports.
PO11 Project management and finance: Apply management principles to manage projects in
multidisciplinary environment.
PO12 Life-long learning: Pursue life-long learning as a means to enhance knowledge and skill.

Program Specific Outcomes (PSO)

PSO1 To empower the students to apply practical skills, knowledge in major streams such as design, thermal,
manufacturing and industrial engineering

PSO2 To enable the student to take up career in industries or to pursue higher studies in mechanical and
interdisciplinary programs with regard to ethics, environment and society.

Chhatrapati Shahu Ji Maharaj University (Formerly Kanpur University), Kanpur. Page 2

1. Subject/ Course information:
Subject/ Course code: Name of Subject/ Course: Year/ Semester:
MEE-S504 Operations Research 2022/8
Group/ Specialization No. of Instructional Units (LTP)
Lecture 3 Tutorial 0 Practical 0 Total Unit Total 4
(L) (T) (P) Credit
2. Course Objectives The course will give an introductory treatment of the governing laws for heat
transfer. The following topics are covered: Steady state and transient conduction,
fundamentals and engineering treatment of convection heat transfer, radiation
heat transfer and heat exchangers. Both analytical and numerical solution
methods are presented.

3. Course Outcomes: At the end of the course, students will be able to:
CO1 Define and formulate linear programming problems and appreciate their limitations.
CO2 Solve linear programming problems using appropriate techniques and optimization
CO3 Conduct and interpret post-optimal and sensitivity analysis and explain the primal-dual relationship.
CO4 Solve Transportation Problems
CO5 Develop mathematical skills to analyse and solve Queing models arising from a wide range of
applications.
Student Evaluation Methods Date Max. Total marks
Marks
a) Evaluation method Internal Assessment 1 : Mid Sem-I 30 30
and weightage Internal Assessment 2 : Mid Sem -II

Teacher’s Assessment Assignment I

(Two Assignment/ Two Assignment II
quiz test/ attendance) Quiz I 7.5 15
Quiz II 7.5
Attendance 5 5
Assessment: Practical
(Sessional + ESE)
Assessment : Final written exam/ Practical 50 50
Exam
Total marks 100

8) Course/ List and provide sharable link of document after placing on Gyan Sanchay/ google drive
Tutorial Notes https://gyansanchay.csjmu.ac.in/operation-research-4/

CO-PO-PSO Mapping
Chhatrapati Shahu Ji Maharaj University (Formerly Kanpur University), Kanpur. Page 3
 PO PSO
CO POI PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO PO PO PSO PSO PSO PSO PSO5 PSO
10 11 12 1 2 3 4 6

3 2 3 2 2 1 3 3 3 3
CO1

3 3 3 3 1 1 1 1 2 3
CO2

3 2 2 3 2 2 2 2 1 3
CO3
CO4 3 3 3 2 2 2 1 1 2
CO5 3 3 2 2 2 1 1 1
CO6 3 3 3 2 2 1 2 2 3

List of Enclosures:
Annexure Details
Annexure I Time table
Annexure II Syllabus/ List of Experiments with recommended books and reference periodicals or websites etc
Annexure III Student’s attendance record
Annexure IV E Content created/ Lab manual URL ( one file containing title and sharable link)
Annexure V Mid semester exam question paper
Annexure VI Marks of Mid semester, quizzes, assignment and attendance.
Annexure VII Final term question paper
Annexure VIII 3 samples of each assignment/ quiz submitted

Name of Subject teacher: Vikash Katiyar Signature:

ID: E-923 Date :

Annexure- I

Chhatrapati Shahu Ji Maharaj University (Formerly Kanpur University), Kanpur. Page 4

 TIME TABLE
DEPARTMENT OF MECHANICAL ENGINEERING, UIET- KANPUR
FIRST HALF SECOND HALF
Time 9:00-10:00
/ 10:00-11:00 11:00-12:00 12:00-01:00 01-02 02:00-03:00 03:00-04:00 04:00-05:00
Days

MON MEE-S504

TUE

WED MEE-S504
LUNCH

THU

FRI MEE-S504

SAT

Annexure- II
Course Code: MEE- S504 Breakup: 3 – 0 – 0 –4 Course Name: Operation Research Course Details: Simplex algorithm,
revised simplex algorithm , duality theory , dual simplex algorithm , sensitivity analysis , transportation and
assignment problems ,network models ,principle of optimality and its applications , queuing systems, sequencing
theory.

Textbook and references:

1. “Operations Research – An Introduction” by H A Taha

2. Operations Research” by K Swarup
3. Operations Research: Theory and Application”
4. Linear Programming Problem by Fawad

Chhatrapati Shahu Ji Maharaj University (Formerly Kanpur University), Kanpur. Page 5

Annexure –III

S. No. University Roll No Student Name

%
Present Absent Total Attend
CSJMA1700139024
1
6 Anamika Choudhary 24 12 36 67%
CSJMA1700139026
2
0 Himanshu yadav 25 11 36 69%
CSJMA1700139026
3
1 jyoti Katiyar 26 10 36 72%
CSJMA1700139028
4
0 PRITI 27 9 36 75%
CSJMA1800139024
5
1 ABHISHEK KUMAR YADAV 28 8 36 78%
CSJMA1800139024
6
2 Aditi tiwari 26 10 36 72%
CSJMA1800139024
7
3 AFREEN ANSARI 31 5 36 86%
CSJMA1800139024
8
4 AJAY PRAJAPATI 25 11 36 69%
CSJMA1800139024
9
5 AMAN VERMA 33 3 36 92%
CSJMA1800139024
10
6 Amit Rajat Pandey 33 3 36 92%
CSJMA1800139024
11
7 Ankit Chauhan 31 5 36 86%
CSJMA1800139024
12
8 Ankur Sharma 26 10 36 72%
CSJMA1800139024
13
9 ANOOP KUMAR YADAV 25 11 36 69%
CSJMA1800139025
14
0 Anshita Patel 28 8 36 78%
CSJMA1800139025
15
1 Anurag Gupta 32 4 36 89%
CSJMA1800139025
16
3 Arpit Singh yadav 33 3 36 92%
CSJMA1800139025
17
5 ASHUTOSH KUMAR 32 4 36 89%
CSJMA1800139025
18
6 ASHWANI SHARMA 25 11 36 69%
CSJMA1800139025
19 ATUL KUMAR TIWARI
7 25 11 36 69%
CSJMA1800139025
20
8 AYUSHI VERMA 32 4 36 89%
21 CSJMA1800139025 BEER PRATAP YADAV 31 5 36 86%

Chhatrapati Shahu Ji Maharaj University (Formerly Kanpur University), Kanpur. Page 6

 9
CSJMA1800139026
22
0 Chitransh Rai 32 4 36 89%
CSJMA1800139026
23
1 Deepak Raj Chaudhary 33 3 36 92%
CSJMA1800139026
24
2 Deepshikhar Saxena 27 9 36 75%
CSJMA1800139026
25
3 DEVESH KUMAR CHATURVEDI 31 5 36 86%
CSJMA1800139026
26
4 Farhan Quazi 30 6 36 83%
CSJMA1800139026 HARISH KUMAR
27
5 VISHWAKARMA 27 9 36 75%
CSJMA1800139026
28
6 HARSHIT DUBEY 27 9 36 75%
CSJMA1800139026
29
8 Himanshu Rathore 29 7 36 81%
CSJMA1800139026
30
9 HIMANSHU RAWAT 29 7 36 81%
CSJMA1800139027
31
1 HUZAIFA MAQBOOL 30 6 36 83%
CSJMA1800139027
32
3 Mansi verma 25 11 36 69%
CSJMA1800139027
33
4 Mohd Farhan 30 6 36 83%
CSJMA1800139027
34
6 OMPRAKASH 27 9 36 75%
CSJMA1800139027
35
7 Poonam verma 30 6 36 83%
CSJMA1800139027
36
8 PRAVEEN KUMAR 31 5 36 86%
CSJMA1800139027
37
9 PRIYANK KUMAR 29 7 36 81%
CSJMA1800139028
38
0 RAHUL KUMAR 30 6 36 83%
CSJMA1800139028
39
1 Rishitosh 28 8 36 78%
CSJMA1800139028
40
2 RITESH KUMAR 32 4 36 89%
CSJMA1800139028
41
3 RITIK SHARMA 29 7 36 81%
CSJMA1800139028
42 SABHAJEET SINGH SAURABH
4 27 9 36 75%
CSJMA1800139028
43
5 Rakesh Panda 32 4 36 89%
CSJMA1800139028
44
6 Saurabh Katiyar 28 8 36 78%
CSJMA1800139028
45
7 SAURABH RAJOTIA 29 7 36 81%

Chhatrapati Shahu Ji Maharaj University (Formerly Kanpur University), Kanpur. Page 7

 CSJMA1800139028
46
8 Shashank Shekhar 26 10 36 72%
CSJMA1800139028
47
9 Shivam Pandey 29 7 36 81%
CSJMA1800139029
48
0 SHIVAM SINGH 29 7 36 81%
CSJMA1800139029
49
1 Shivanshi Sonkar 30 6 36 83%
CSJMA1800139029
50
3 Swarnima kasera 25 11 36 69%
CSJMA1800139029
51
4 UDIT MISHRA 31 5 36 86%
CSJMA1800139029
52
5 Vidyant 30 6 36 83%
CSJMA1800139029
53
6 VIKAS KUMAR 30 6 36 83%
CSJMA1800139029
54
7 shashank kumar 33 3 36 92%
CSJMA1800139029
55 MANAS SINGH
8 29 7 36 81%
CSJMA1800139029
56
9 Aman Kumar Vishwakarma 25 11 36 69%
CSJMA1800139030
57
0 Kartikay Kumar Singh 33 3 36 92%
CSJMA1800139030
58
5 Ankit chaturvedi 27 9 36 75%

Annexure - IV E Content created/ Lab manual URL ( one file containing title and sharable link)

https://gyansanchay.csjmu.ac.in/operation-research-4/

Annexure -V

Chhatrapati Shahu Ji Maharaj University (Formerly Kanpur University), Kanpur. Page 8

 MID-SEMESTER EXAMINATION
Operations Research (MEE-S504 /2021-22)
TIME: 1.5 Hours MAX MARKS: 30

All questions carry equal marks

1. An investor is considering investing in two securities 'A' and 'B'. The risk and return associated with
these securities is different. Security 'A' gives a return of 9% and has a risk factor of 5 on a scale of zero
to 10. Security 'B' gives return of 15% but has risk factor of 8. Total amount to be invested is Rs. 5, 00,
000/- Total minimum returns on the investment should be 12%. Maximum combined risk should not be
more than 6. Formulate as LPP.
2. A firm produces three products A, B, and C each of which passes through three different departments
fabrication, finishing, packaging. Each unit of product A requires 3, 4 and 2 hours respectively, B requires
5, 4 and 4 hours respectively and C requires 2, 4 and 5 hours respectively in 3 departments respectively.
Every day 60 hours are available in fabrication department, 72 hours in finishing and 100 hours in
packaging department. If unit contribution of unit A is Rs. 5, Rs. 10 for B and Rs. 3 for C. Then determine
number of units of each product so that total contribution to cost is maximized and also determine if any
capacity would remain unutilized.
3. Solve using 2 phase method
Maximize =2x1 + 3x2 + 4 x3
Subject to
3x1 + 2x2 + x3 ≤ 10
2x1 + 3x2 + 3 x3 ≤ 15
x1 + x2 - x3 ≥ 4
x1, x2, x3 ≥ 0
4. Solve using Big M Method
Minimize = 4x1 +x2
Subject to:
3x1 +x2 = 3
4x1 +3x2 ≥ 6
x1 +2x2 ≤ 3
x1, x2 ≥ 0 .
5. An electronics firm manufactures three products - transistors, resistors and capacitors which give
profit of Rs. 100, 60 and 40 per unit respectively. The firm uses three resources - Engineering, Direct
Labour and Admin. The capacities are 100, 600 and 300 hrs. respectively Z(max)= 100x1+200x2+40x3

x1 x2 x3 s1 s2 s3 sol
22000/
z 0 0 -80/3 0 -40/3 0 3
x2 0 1 5/6 1 -1/6 0 200/3
x1 1 0 1/6 0 1/6 0 100/3
s3 0 0 4 0 1 100
The above table is the optimum solution found after iteration. Find the following:

(i) Range for profit coefficients of products x1 and x2

(ii) Range for capacity or availability of Engineering hours

Chhatrapati Shahu Ji Maharaj University (Formerly Kanpur University), Kanpur. Page 9

Annexure VI
Program, Branch, Specilization, Odd / Even Sem, Session, Section / Group
Computation of Course Outcomes (COs)
Subject Code : MEE-S-504 Program : Engineering Specilization : Mechanical
Subject Name : OPERATION RESEARCH Branch : Mechanical Session : 2021-22
Data of Direct
Data of Direct (Internal)
(External)
S. Assessment
Assessment Remarks,
No University Roll No Student Name
MM = 50 MM = 50 if any
.
Marks Per
Marks Obt. Per cent
Obt. cent
1 CSJMA17001390246 Anamika Choudhary 23 46% 17 34% Backlogger
2 CSJMA17001390260 Himanshu yadav 27.5 55% 28 56% Backlogger
3 CSJMA17001390261 jyoti Katiyar 22.5 45% 23.58 47% Backlogger
4 CSJMA17001390280 PRITI 21.5 43% 20 40% Backlogger
5 CSJMA18001390241 ABHISHEK KUMAR YADAV 20.5 41% 15 30%
6 CSJMA18001390242 Aditi tiwari 29.5 59% 33.5 67%
7 CSJMA18001390243 AFREEN ANSARI 26.5 53% 26 52%
8 CSJMA18001390244 AJAY PRAJAPATI 27 54% 22 44%
9 CSJMA18001390245 AMAN VERMA 24.5 49% 23 46%
10 CSJMA18001390246 Amit Rajat Pandey 27 54% 21 42%
11 CSJMA18001390247 Ankit Chauhan 32 64% 35 70%
12 CSJMA18001390248 Ankur Sharma 26.5 53% 29.5 59%
13 CSJMA18001390249 ANOOP KUMAR YADAV 37 74% 29 58%
14 CSJMA18001390250 Anshita Patel 33 66% 33 66%
15 CSJMA18001390251 Anurag Gupta 34.5 69% 31.5 63%
16 CSJMA18001390253 Arpit Singh yadav 27.5 55% 35 70%
17 CSJMA18001390255 ASHUTOSH KUMAR 37 74% 24 48%
18 CSJMA18001390256 ASHWANI SHARMA 27.5 55% 28.5 57%
19 CSJMA18001390257 ATUL KUMAR TIWARI 29 58% 32 64%
20 CSJMA18001390258 AYUSHI VERMA 27 54% 23 46%
21 CSJMA18001390259 BEER PRATAP YADAV 33 66% 32 64%
22 CSJMA18001390260 Chitransh Rai 35.5 71% 31 62%
23 CSJMA18001390261 Deepak Raj Chaudhary 31 62% 23.5 47%
24 CSJMA18001390262 Deepshikhar Saxena 31 62% 28 56%
25 CSJMA18001390263 DEVESH KUMAR CHATURVEDI 29 58% 36 72%
26 CSJMA18001390264 Farhan Quazi 30 60% 26 52%
HARISH KUMAR
27 55% 45%
CSJMA18001390265 VISHWAKARMA 27.5 22.5
28 CSJMA18001390266 HARSHIT DUBEY 37.5 75% 28.5 57%
29 CSJMA18001390268 Himanshu Rathore 30.5 61% 24.5 49%
30 CSJMA18001390269 HIMANSHU RAWAT 32 64% 20 40%
31 CSJMA18001390271 HUZAIFA MAQBOOL 40.5 81% 41 82%
32 CSJMA18001390273 Mansi verma 29 58% 29.5 59%

Chhatrapati Shahu Ji Maharaj University (Formerly Kanpur University), Kanpur. Page 10

 33 CSJMA18001390274 Mohd Farhan 32.5 65% 29 58%
34 CSJMA18001390276 OMPRAKASH 38.5 77% 24 48%
35 CSJMA18001390277 Poonam verma 24 48% 21.5 43%
36 CSJMA18001390278 PRAVEEN KUMAR 27 54% 31 62%
37 CSJMA18001390279 PRIYANK KUMAR 27 54% 18.5 37%
38 CSJMA18001390280 RAHUL KUMAR 33 66% 34 68%
39 CSJMA18001390281 Rishitosh 27.5 55% 27 54%
40 CSJMA18001390282 RITESH KUMAR 22.5 45% 23 46%
41 CSJMA18001390283 RITIK SHARMA 30 60% 26 52%
42 CSJMA18001390284 SABHAJEET SINGH SAURABH 21.5 43% 23 46%
43 CSJMA18001390285 Rakesh Panda 27.5 55% 18 36%
44 CSJMA18001390286 Saurabh Katiyar 34.5 69% 34.5 69%
45 CSJMA18001390287 SAURABH RAJOTIA 36 72% 29.5 59%
46 CSJMA18001390288 Shashank Shekhar 34 68% 25.5 51%
47 CSJMA18001390289 Shivam Pandey 32 64% 24 48%
48 CSJMA18001390290 SHIVAM SINGH 27.5 55% 29 58%
49 CSJMA18001390291 Shivanshi Sonkar 32.5 65% 29 58%
50 CSJMA18001390293 Swarnima kasera 30 60% 23 46%
51 CSJMA18001390294 UDIT MISHRA 31.5 63% 31 62%
52 CSJMA18001390295 Vidyant 27.5 55% 19 38%
53 CSJMA18001390296 VIKAS KUMAR 32.5 65% 26.5 53%
54 CSJMA18001390297 shashank kumar 27.5 55% 31 62%
55 CSJMA18001390298 MANAS SINGH 28 56% 26 52%
56 CSJMA18001390299 Aman Kumar Vishwakarma 27 54% 28.5 57%
57 CSJMA18001390300 Kartikay Kumar Singh 29.5 59% 26.5 53%
58 CSJMA18001390305 Ankit chaturvedi 30 60% 24.5 49%

Annexure - VII

UNIVERSITY INSTITUTE OF ENGINEERING & TECHNOLOGY

END-SEMESTER EXAMINATION
Chhatrapati Shahu Ji Maharaj University (Formerly Kanpur University), Kanpur. Page 11
 Operations Research (MEE-S504 /2021-22)
TIME: 3.0 Hours MAX MARKS: 50

Section A (1X 10)

1. A feasible solution to a linear programming problem _____________.

A. must satisfy all the constraints of the problem simultaneously
B. need not satisfy all of the constraints, only some of them
C. must be a corner point of the feasible region.
D. must optimize the value of the objective function

2. For any primal problem and its dual______________.

A. optimal value of objective function is same

B. dual will have an optimal solution iff primal does too
C. primal will have an optimal solution iff dual does too
D. both primal and dual cannot be infeasible

3. ______________ is a mathematical technique used to solve the problem of allocating

limited resource among the competing activities
4. Linear Programming problem
5. Assignment Problem
6. Replacement Problem
7. Non linear Programming Problem

4. A set of feasible solution to a Linear Programming Problem is ______________

A. convex
B. polygon
C. triangle
D. bold

5. If the primal problem has n constraints and m variables then the number of constraints in the dual
problem is ______________.

A. mn
B. m+n
C. m-n
D. m/n

6. The non basic variables are called ______________.

A. shadow cost
B. opportunity cost
C. slack variable
D. surplus variable
7. The solution to a transportation problem with m-sources and n-destinations is feasible if the
numbers of allocations are ______________.

Chhatrapati Shahu Ji Maharaj University (Formerly Kanpur University), Kanpur. Page 12

 A. m+n
B. mn
C. m-n
D. m+n-1

8. To resolve degeneracy at the initial solution, a very small quantity is allocated in

______________ cell

A. occupied
B. unoccupied
C. no
D. finite

9. Mathematical model of linear programming problem is important because ______________.

A. it helps in converting the verbal description and numerical data into mathematical
expression
B. decision makers prefer to work with formal models
C. it captures the relevant relationship among decision factors
D. it enables the use of algebraic technique

10. For finding an optimum solution in transportation problem ______________ method is used.

A. Simplex
B. Big-M
C. Modi
D. Hungarian

Section –B (4x 5)

1. What is the significance of introducing slack, surplus and artificial variable in LPP?
2. What is degeneracy in transportation problem? Discuss its consequences and how it is
overcome?
3. Sudhakant has two iron mines. The production capacities of the mines are different. The
iron ore can be classifies into good, mediocre and bad varieties after certain process. The
owner has decided to supply 12 or more tons of good iron, 8 or more tons of mediocre iron
and 24 or more tons of bad iron per week. The daily expense is Rs.2000 and that of the
second mine is Rs.1600. The daily production of each type of iron is given in the table.

Daily Production
MINE
Good Mediocre Bad
I 6 2 4
II 2 2 12
Formulate the LPP

4. Solve the above LPP

Chhatrapati Shahu Ji Maharaj University (Formerly Kanpur University), Kanpur. Page 13

 Section C ( 4 x 5 )

1. (a) Solve the following LPP

Zmin = x1 -2x2 -3x3
s.t. -2x1 + x2 +3x3 = 2
2x1 + 3x2 +4x3 = 1
xi > 0

1. (b) Solve the following by dual simplex method :

Zmax = -2x1 -2x2 -4x3
s.t. 2x1 +3 x2 +5x3 > 2
3x1 + x2 +7x3 < 3
x1 + 4x2 +6x3 < 5
xi > 0
2. The mileage chart is given for a transportation model

Demand 1 Demand 2 Demand 3 Demand 4 Supply

Origin 1 42 48 38 37 16
Origin 2 40 49 52 51 15
Origin 3 39 38 40 43 19
Demand 8 9 11 16

(a) Find the initial solution by NWC method, min cost method and penalty method.
(b) Solve the transportation model to minimize the total transportation cost.

Chhatrapati Shahu Ji Maharaj University (Formerly Kanpur University), Kanpur. Page 14

Annexure – VIII
Assignment – I

1. A television company has three major departments for manufacturing two of its models – A and B. The monthly
capacities of the departments are given as follows: Per Unit Time Requirement (hours) Hours Available Model A
Model B this Month Department I 4.0 2.0 1,600 Department II 2.5 1.0 1,200 Department III 4.5 1.5 1,600 The
marginal profit per unit from model A is Rs 400 and from model B is Rs 100. Assuming that the company can sell any
quantity of either product due to favourable market conditions, determine the optimum output for both the models,
the highest possible profit for this month and the slack time in the three departments.

2. A manufacturer of leather belts makes three types of belts A, B and C which are processed on three machines M1,
M2 and M3. Belt A requires 2 hours on machine M1 and 3 hours on machine M2 and 2 hours on machine M3. Belt B
requires 3 hours on machine M1, 2 hours on machine M2 and 2 hours on machine M3 and Belt C requires 5 hours on
machine M2 and 4 hours on machine M3. There are 8 hours of time per day available on machine M1, 10 hours of
time per day available on machine M2 and 15 hours of time per day available on machine M3. The profit gained from
belt A is Rs 3.00 per unit, from Belt B is Rs 5.00 per unit, from belt C is Rs 4.00 per unit. What should be the daily
production of each type of belt so that the products yield the maximum profit?

3. A company produces three products A, B and C. These products require three ores O1, O2 and O3. The maximum
quantities of the ores O1, O2 and O3 available are 22 tonnes, 14 tonnes and 14 tonnes, respectively. For one tonne of
each of these products, the ore requirements are: ABC O1 3–3 O2 123 O3 323 Profit per tonne 1 4 5 (Rs in thousand)
The company makes a profit of Rs 1,000, 4,000 and 5,000 on each tonne of the products A, B and C, respectively.
How many tonnes of each product should the company produce in order to maximize its profits.

4. A manufacturing firm has discontinued the production of a certain unprofitable product line. This has created
considerable excess production capacity. Management is considering to devote this excess capacity to one or more of
three products; call them product 1, 2 and 3. The available capacity on the machines that might limit output is
summarized in the following table: Machine Type Available Time (in Machine-hours per Week) Milling Machine 250
Lathe 150 Grinder 50 The number of machine-hours required for each unit of the respective product is as follows:
Machine Type Productivity (in Machine-hours per Unit) Product Product Product 12 3 Milling Machine 8 2 3 Lathe 4 3
0 Grinder 2 – 1 The profit per unit would be Rs 20, Rs 6 and Rs 8, respectively for product 1, 2 and 3. Find how much
of each product the firm should produce in order to maximize its profit.

5. A farmer has 1,000 acres of land on which he can grow corn, wheat or soyabean. Each acre of corn costs Rs 100 for
preparation, requires 7 men-days of work and yields a profit of Rs 30. An acre of wheat costs Rs 120 to prepare,
requires 10 men-days of work and yields a profit of Rs 40. An acre of soyabean costs Rs 70 to prepare, requires 8
men-days of work and yields a profit of Rs 20. If the farmer has Rs 1,00,000 for preparation and can count on 8,000
men-days of work, determine how many acres should be allocated to each crop in order to maximize profits? [Delhi
Univ., MBA, 2004]

6. The annual handmade furniture show and sale is supposed to take place next month and the school of vocational
studies is also planning to make furniture for this sale. There are three wood-working classes – I year, II year and III
year, at the school and they have decided to make styles of chairs – A, B and C. Each chair must receive work in each
class. The time in hours required for each chair in each class is: Chair I Year II Year III Year A 243 B 332 C 214 During
the next month there will be 120 hours available to the I year class, 160 hours to the II year class, and 100 hours to

Chhatrapati Shahu Ji Maharaj University (Formerly Kanpur University), Kanpur. Page 15

the III year class for producing the chairs. The teacher of the wood-working classes feels that a maximum of 40 chairs
can be sold at the show. The teacher has determined that the profit from each type of chair will be: A, Rs 40; B, Rs 35
and C, Rs. 30. How many chairs of each type should be made in order to maximize profits at the show and sale?

Assignment – II

4. A computer centre has four expert programmers and needs to develop four application programmes. The head of
the computer centre, estimates the computer time (in minutes) required by the respective experts to develop the
application programmes as follows:

Programmes

A B C D

Chhatrapati Shahu Ji Maharaj University (Formerly Kanpur University), Kanpur. Page 16

Programmers 1 120 100 80 90

2 80 90 110 70

3 110 140 120 100

4 90 90 80 90

Find the assignment pattern that minimizes the time required to develop the application programmes

Quiz -I

(1) To find initial feasible solution of a transportation problem the method which starts allocation from the lowest
cost is called method.

(a) north west corner (b) least cost (c) south east corner (d) Vogel’s approximation

(2) In a transportation problem, the method of penalties is called method.

(a) least cost (b) south east corner (c) Vogel’s approximation (d) north west corner

(3) When the total of allocations of a transportation problem match with supply and demand values, the solution is
called solution.

(a) non-degenerate (b) degenerate (c) feasible (c) feasible (d) infeasible

(4) When the allocations of a transportation problem satisfy the rim condition (m + n – 1) the solution is called
solution.

(a) degenerate (b) infeasible (c) unbounded (d) non-degenerate

(5) When there is a degeneracy in the transportation problem, we add an imaginary allocation called in the solution.
(a) dummy (b) penalty (c) epsilon (d) regret

(6) If M + N – 1 = Number of allocations in transportation, it means . (Where ‘M’ is number of rows and ‘N’ is number
of columns)

(a) There is no degeneracy (b) Problem is unbalanced (c) Problem is degenerate (d) Solution is optimal

(7) Which of the following considers difference between two least costs for each row and column while finding initial
basic feasible solution in transportation?

(a) North west corner rule (b) Least cost method (c) Vogel’s approximation method (d) Row minima method

(8) The solution to a transportation problem with m-sources and n-destinations is feasible if the numbers of
allocations are ___________.

(a) m+n (b) mn (c) m-n (d) m+n-1

Chhatrapati Shahu Ji Maharaj University (Formerly Kanpur University), Kanpur. Page 17

 Quiz -II

(1) When the total demand is equal to supply then the transportation problem is said to be _________

(a) balanced (b) unbalanced (c) maximization (d) minimization

(2) When the total demand is not equal to supply then it is said to be __________.

(a) balanced (b) unbalanced (c) maximization (d) minimization

(3) The allocation cells in the transportation table will be called ____________ cell

(a) occupied (b) unoccupied (c) no (d) finite

(4) In the transportation table, empty cells will be called ___________.

(a) occupied (b) unoccupied (c) basic (d) non-basic

(5) In a transportation table, an ordered set of___________or more cells is said to form a loop

(a) 2 (b) 3 (c) 4 (d) 5

(6) To resolve degeneracy at the initial solution, a very small quantity is allocated in ____________ cell

(a) occupied (b) basic (c) non-basic (d) unoccupied

(7) For finding an optimum solution in transportation problem ____________ method is used.

(a) Modi (b) Hungarian (c) Graphical (d) simplex

Chhatrapati Shahu Ji Maharaj University (Formerly Kanpur University), Kanpur. Page 18