Problem 3:

ABC Manufacturing Company tape recorder company manufactures Products A, B and C, which
have profit contributions per unit of Rs 15, Rs. 40 and Rs. 60, respectively. The weekly minimum
production requirements are 25 units for Product A, 130 units for Product B and 55 units for Product
C. Each type of recorder requires a certain amount of time for the manufacturing of the component
parts, for assembling and for packing. Specifically, a dozen units of Product A require 4 hours for
manufacturing, 3 hours for assembling and 1 hour for packaging. The corresponding figures for a
dozen units of Product B are 2.5, 4 and 2 and for a dozen units of Product C are 6, 9 and 4. During
the forthcoming week, the company has available 130 hours of manufacturing, 170 hours of
assembling and 52 hours of packaging time. Formulate this problem as an LP model so as to
maximize the total profit to the company. OR, Operations Management, Math, Statistics, OM,
Operations Management, Programming, Formulation, Maximization, Minimization, Decision
Variables, Objective Function, Constraints, LPP, MBA, MCA, CA, CS, CWA, BBA BCA, BCom,
MCom, GRE, GMAT, Grade 11, Grade 12, Class 11, Class 12, IAS, CAIIB, FIII, IBPS, BANK PO,
UPSC, CPA, CMA General Mathematical Model of LPP: The number of problems, showing how to
model them by the appropriate choice of decision variables, objective, and constraints. Any linear
programming problem involving more than two variables may be expressed as follows:
Find the values of the variable x1, x2,............, xn which maximize (or minimize) the objective
function
Z = c1x1 + c2x2 + .............. + cnxn
subject to the constraints a11x1 + a12x2 + ............. + a1nxn b1 a21x1 + a22x2 + ............. + a2nxn
b2 ........................ am1x1 + am2x2 + .............. + amnxn bm and meet the non negative
restrictions x1, x2, ..., xn 0
a) A set of values x1, x2,.. xn which satisfies the constraints of linear programming problem is called
its solution.

b) Any solution to a linear programming problem which satisfies the non negativity restrictions of the
problem is called its feasible solution.

c) Any feasible solution which maximizes(or minimizes) the objective function of the linear
programming problem is called its optimal solution
OR, Operations Management, Math, Statistics, OM, Operations Management, Programming,
Formulation, Maximization, Minimization, Decision Variables, Objective Function, Constraints, LPP,
MBA, MCA, CA, CS, CWA, BBA BCA, BCom, MCom, GRE, GMAT, Grade 11, Grade 12, Class 11,
Class 12, IAS, CAIIB, FIII, IBPS, BANK PO, UPSC, CPA, CMA We can list the following important
point when we are to formulate any managerial or real life problem: The steps to model a problem
are the following: Step 1: Determining decision variables and expressing them algebraically. X1,...,
Xn Step 2: Determining Objective Function. Maximize or minimize Z = C1X1 + C2X2 + ... + CnXn
Step 3: Determining the restrictions and expressing them as equations or inequalities in function of
the decision variables: A11X1 + A122 + ... + A1nXn (, , or =) b1 A21X1 + A22X2 + ... +
A2nXn (, , or =) b2 ... Am1X1 + Am2X2 + ... + AmnXn (, , or =) bm Step 4: Expressing all
implicit conditions established by the origin of variables: negativeness, integer, only a few allowed
values, ... X1,..., Xn 0 X1,..., Xn are integers, Raja Toys Mfg Ltd manufactures wooden soldiers
and trains. Each soldier sells for Rs. 27, uses Rs. 10 of raw materials and takes Rs. 14 of labor &
overhead costs. Each train sells for Rs. 21, uses Rs. 9 of raw materials, and takes Rs. 10 of
overhead costs. Each soldier needs 2 hours finishing and 1 hour carpentry; each train needs 1 hour
finishing and 1 hour carpentry. Raw materials are unlimited, but only 100 hours of finishing and 80
hours of carpentry are available each week. Demand for trains is unlimited; but at the most 40
soldiers can be sold each week. How many of each toy should be made each week to maximize
profits? Formulate this as an LPP.
Problem 4
A company produces 3 products X, Y and Z. The production department produces each day,
components sufficient to make 50 units of X, 25 units of Y and 30 units of Z. the management is
confronted with the problem of optimizing the daily production of the products in the assembly
department, where only 100 man-hours are available daily for assembling the products. The
following additional information is available: Type of Product X Y Z Profit Contribution per unit of
Product (Rs) 12 20 45 Assembly Time per Product (hrs) 0.8 1.7 2.5 The company has a daily order
commitment for 20 units of product X and a total of 15 units of Y and Z. Formulate this problem as
an LP model so as to maximize the total profit. General Mathematical Model of LPP: The number of
problems, showing how to model them by the appropriate choice of decision variables, objective,
and constraints. Any linear programming problem involving more than two variables may be
expressed as follows: Find the values of the variable x1, x2,............, xn which maximize (or
minimize) the objective function Z = c1x1 + c2x2 + .............. + cnxn subject to the constraints
a11x1 + a12x2 + ............. + a1nxn b1 a21x1 + a22x2 + ............. + a2nxn b2 ........................
am1x1 + am2x2 + .............. + amnxn bm and meet the non negative restrictions x1, x2, ..., xn 0
a) A set of values x1, x2,.. xn which satisfies the constraints of linear programming problem is called
its solution. b) Any solution to a linear programming problem which satisfies the non negativity
restrictions of the problem is called its feasible solution. c) Any feasible solution which maximizes(or
minimizes) the objective function of the linear programming problem is called its optimal solution OR,
Operations Management, Math, Statistics, OM, Operations Management, Programming,
Formulation, Maximization, Minimization, Decision Variables, Objective Function, Constraints, LPP,
MBA, MCA, CA, CS, CWA, BBA BCA, BCom, MCom, GRE, GMAT, Grade 11, Grade 12, Class 11,
Class 12, IAS, CAIIB, FIII, IBPS, BANK PO, UPSC, CPA, CMA