Scribd
Upload
5 views13 pages

Tut 02 Linear Programming

The document explains linear programming (LP) as an optimization problem involving the maximization or minimization of a linear objective function subject to linear constraints and sign restrictions on decision variables. It provides examples, including a company's production optimization for products A and B, a dealer's investment in fans and sewing machines, and a firm's manufacturing of digestive tablets, detailing the formulation and graphical solutions for each case. The optimal solutions for the examples are calculated, demonstrating the application of LP in real-world scenarios.

Uploaded by

ajbhansali72
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
5 views13 pages

Tut 02 Linear Programming

The document explains linear programming (LP) as an optimization problem involving the maximization or minimization of a linear objective function subject to linear constraints and sign restrictions on decision variables. It provides examples, including a company's production optimization for products A and B, a dealer's investment in fans and sewing machines, and a firm's manufacturing of digestive tablets, detailing the formulation and graphical solutions for each case. The optimal solutions for the examples are calculated, demonstrating the application of LP in real-world scenarios.

Uploaded by

ajbhansali72
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

Linear Programming

Linear Programming Problem


• A linear programming problem (LP) is an
optimization problem for which we do the following:
1. Attempt to maximize (or minimize) a linear function (called
the objective function) of the decision variables.
2. The values of the decision variables must satisfy a set of
constraints. Each constraint must be a linear equation or
inequality.
3. A sign restriction is associated with each variable. For each
variable xi, the sign restriction specifies either that xi must
be nonnegative (xi ≥ 0) or that xi may be unrestricted in
sign.
Formulation of the Problem
• Understand the problem thoroughly.
• Describe the objective.
• Describe each constraint.
• Define the decision variables.
• Write the objective in terms of the decision
variables.
• Write the constraints in terms of the decision
variables.
• An XYZ company is producing two different types of
products namely A and B. Both the products go through
machines X and Y. Product A requires 2 hours
processing on machine X and 1 hour processing on
machine Y. Product B requires 1 hour processing on
machine X and 2 hours processing on machine Y.
Available machine hours for X and Y are 104 hours and
76 hours respectively. The profit on each unit of
product A and B are $6 and $11 respectively.
• (a) Find optimal quantity of production for product A

• (b) Find optimal quantity of production for product B

• Determine optimal profit [2]


• No of A= 44
• No of B = 16
• Z = $440
Exhibit PC-11
Production Data for Cinnamon- Scented Products

6
Copyright © 2017 Pearson India Education Services Pvt. Ltd
Exhibit PC-12
Graphical Solution to Linear Programming Problem

7
Copyright © 2017 Pearson India Education Services Pvt. Ltd
• A dealer wishes to purchase a number of fans
and sewing machines. He has only Rs. 5,760 to
invest and has space for at most 20 items. A fan
and sewing machine cost Rs. 360 and Rs. 240
respectively. He can sell a fan at a profit of Rs. 22
and sewing machine at a profit of Rs. 18.
Assuming that he can sell whatever he buys,
how should he invest his money in order to
maximize his profit? Translate the problem into
LPP and solve it graphically.
• Max Z = 22x1+18x2
• Subject to
• 360x1+240x2 <=5760
• X1+x2<=20
• (16,0); (0, 20), (8,12)- feasible region
• X1 = 8
• X2 = 12
• Max Z= 392
• A firm manufactures digestive tablets in two sizes X and Y.
Size X contains 4 grains of element a, 7 grains of element b
and 2 grains of element c and size Y contains 2 grains of
element a, 10 grains of element b and 8 grains of c. It is
found by users that it requires at least 12 grains of
element a, 74 grains of element b and 24 grains of
element c to provide immediate relief. Assuming yourself
to be the manager (R&D) of the firm, determine the least
number of tablets (optimal mixture of sizes) a patient
should take to get immediate relief from digestive
disorders by a suitable graphical formulation of the
problem through standard Linear Programming Problem
(LPP).
• Objective function
• Minimum of digestive tablets (Z) = X1 + Y1
• Constraints
• Case 1: 4 X1 + 2Y1 ≥ 12
• Case 2: 7 X1 + 10Y1 ≥ 74
• Case 3: 2 X1 + 8Y1 ≥ 24
• Point A (0, 7.4): Z (A) = 0 + 7.4 = 7.4 units
(minimum)
• Point B (9.6, 0.6): Z (B) = 9.6 + 0.6 = 10.2 units
• Point C (12, 0): Z (C) = 12 + 0 = 12 units
•
• Therefore, a tablet of size Y is recommended
and the minimum dose is around 8 tablets to
get immediate relief from digestive disorder.

You might also like