QUANTITATIVE THEORY OF MANAGEMENT

CASE STUDY ON

LINEAR PROGRAMMING PROBLEMS

Submitted to: Dr. Mona Verma

Class: BMS-3D

Submitted by:
Tanya Verma - 19203
Yatin Miglani - 19224
 Page No.
Daie

imla AcoamAmingLPP

Lmla [hAgramm Jo Audkiomv &kodung

ptmiaatiem phelom. LPP JA hlehi wv

diuslepainq amd Aeling a dALSM makeng
pMeAim Jymathuumascal tshaigms-

ciom Jshiuhmuda e sptaistd Aubyi

Ea0mtialo LPPmec
DiAem Vaiab:VaiaLA shich ou
Jhamoal and oinqe wmpact hu dusiauom
sthiA
t paluo pnd pici mAY AMich n

h Ewmdben: wnuaw unttuer sthe

nctimN, tha te maUmua mmimsal
utc.
R pmAmua peld, Aaluo, pheokucdtien
OMOumllen,
m d nimimwab AA, Vmuay,

Lploind Jhaënoh a iewmslm iwku

iitaton O MOualA,tmwnos
 Page No.

Dute

MA AJAo Jathu Mthich mnul uamaimMM

oadiuathu iom

mubdion LPpeldim
ceoinu thu duiaiomAualapmd amgnu
Apls tethuny ku X,Y,z_Amd s&AM
tnpuoALeAall ponatraunto im tUVms
imtaualitkpiun'jin lateny tothu diosen
OHLalA

3 Fatomaslatuths sbjutia unttgm jn tuomd a{ hi

Addhu mn-mugadury tnoutien |Lnobvain+o

An metinq all th AKiodruo, kenalauaaa amd

phecuoA. Ihphellmcom ALoeuad in MRuSo

1.(haphiual mutheds
2. hueuah R hw opm 0ucu test
3. Thasghy AsaN
. Thngh Aimpluw muthed
 CASE STUDY

Reference: Introduction to Operations Research, 9e. by Frederick S. Hillier & Gerald J. Lieberman
 agpr No.
Date

Femlaliam al LPP
Gojctw-momnal phst
ohaltaimt- amlao lobo'y heum k desa
Vauabuo-Ma Arano dumamoudu

Hpuanta moAMwk

Moa
Z 3600 t 5100

6t10.5 12,000
22 20,000
3,500

In drv Jtaol waimq mplua muthok, R

Addhmo albck Nanuallus-

M Z 3600, tt5400*2 t05, t0s,t 0S,-

 Page No.

Date

Aukut to
6 t10.5r, t S 18000
20000
t5 3500

Ltunatue-1
3600 5100
Cg B
6 10.5 1 0 0 19000 1571.12
2 0 0 2000 0000
0 0 3500 3500
-3600 54001 0 0 0

tuinq aialt ,
Dupotha woiabl: 5
K Elunn 1

Ltnatem-
3400 5400 0 0 0

0 0 0 0 Il250 1876
0 0 0 13000 3250
5100 N 0 0 3500
3600 0
 Page No.
Date

Adualtu S
Ky lmii 6
0

Iugm-3
3600 510O 00 O
Cor
3600 O.16 0135 1215
5 0 0 -0.6 SS500 1100
5y00 0 0 3500 3500
0 G00 9 0 0

umg AOHialtu : 5
Eilvoiall
KuyElmunt

Ihuation-
Cg B
3600 O -0.6t 0.35 0 3800
0 0-013 0.2 ILO0
5100 0.13-02 0 2100
490 180
O
N
N
 Page No.

Date

Dwal
Hy pim pheldum a pima pMalAimz

Masmimu Z= 3600 t5100

Auhu ta
o l0.5 <18000
t R 20000
3500
20

Hu E|3600 54ao
CIstal
Run

-4800D
20 00 0
LReauo vtr)
3500

ndu u E
105
2
C um
madhid J
 Page No.
Date

3600
5100
b' 8000 20000 3500

10.5

Aanls huH a52 KanoiHamto

thu dual uAMAalk
An pWma ve amximuaaln AMelAlmdual
w /_minmoatiem phelm.

lhuuuh dunl ta this pslmyLg

MinimiZ Mg000 20,000 3500y

by,+4,+0M Z 3600
Following are solutions to the questions mentioned in the problem statement
using Excel Solver:

Answers to the Problem Statement

a)
 Solver Output:

The number of Family Thrillseekers and the

number of Classy Cruiser should be assembled
are 3800 and 2400 cars respectively.

b)

c)

Solver Output:

With the new assembly plant capacity, 3250

Thrillseekers and 3500 Classy Cruisers should be
assembled.
d)

e)

Solver Output:

In conclusion, 3000 Family Thrillseekers and

4000 Classy Cruisers should be assembled using
the advertising campaign and overtime labor-
hours if the profit from each Classy Cruiser sold
continues to be 50% more than for each Family
Thrillseeker sold.

f)
g)

Solver Output:

The number of Family Thrillseekers and

Classy Cruisers should be assembled are
1875 and 3500 cars.