Scribd
Upload
37 views

Linear Programming

This document provides an example of solving a linear programming problem to maximize the objective function 3A + 2B subject to the constraints A + B ≤ 10, 3A + B ≤ 24, and A + 2B ≤ 16. The optimal solution is found to be A = 7 and B = 3, with an optimal value of 27. Several exercises with similar linear programming problems are then presented.

Uploaded by

Mohammad Akmal
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
37 views

Linear Programming

This document provides an example of solving a linear programming problem to maximize the objective function 3A + 2B subject to the constraints A + B ≤ 10, 3A + B ≤ 24, and A + 2B ≤ 16. The optimal solution is found to be A = 7 and B = 3, with an optimal value of 27. Several exercises with similar linear programming problems are then presented.

Uploaded by

Mohammad Akmal
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/ 19

BPA 12203

MATHEMATICS FOR MANAGEMENT


Chapter 6

LINEAR PROGRAMMING

Dr Chandra

Mathematics for Management Linear Programming


Optimal Solution and Optimal Value

Example 1:

Maximize (Max) 3A + 2B
subject to (s.t.)

A + B ≤ 10
3A + B ≤ 24
A + 2B ≤ 16
A, B ≥ 0

Mathematics for Management Linear Programming


Example 1:

Maximize (Max) 3A + 2B
subject to (s.t.)

A + B ≤ 10 (Constraint 1)
3A + B ≤ 24 (Constraint 2)
A + 2B ≤ 16 (Constraint 3)
A, B ≥ 0

Mathematics for Management Linear Programming


Solution:

Constraint 1:
Let A = 0, B = 10 → (0, 10)
Let B = 0, A = 10 → (10, 0)

Mathematics for Management Linear Programming


Solution:

Constraint 1:
Let A = 0, B = 10 → (0, 10)
Let B = 0, A = 10 → (10, 0)

Constraint 2:
Let A = 0, B = 24 → (0, 24)
Let B = 0, A = 8 → (8, 0)

Mathematics for Management Linear Programming


Solution:

Constraint 1:
Let A = 0, B = 10 → (0, 10)
Let B = 0, A = 10 → (10, 0)

Constraint 2:
Let A = 0, B = 24 → (0, 24)
Let B = 0, A = 8 → (8, 0)

Constraint 3:
Let A = 0, B = 8 → (0, 8)
Let B = 0, A = 16 → (16, 0)

Mathematics for Management Linear Programming


Objective function: 3A + 2B = 12
Let A = 0, B = 6 → (0, 6)
Let B = 0, A = 4 → (4, 0)

Mathematics for Management Linear Programming


Objective function: 3A + 2B = 12
Let A = 0, B = 6 → (0, 6)
Let B = 0, A = 4 → (4, 0)

Mathematics for Management Linear Programming


From C1,
A + B = 10
A = 10 − B

Mathematics for Management Linear Programming


From C1,
A + B = 10
A = 10 − B
Replace A in C2,
3(10 − B) + B = 24
30 − 3B + B = 24
2B = 6
B=3

Mathematics for Management Linear Programming


From C1,
A + B = 10
A = 10 − B
Replace A in C2,
3(10 − B) + B = 24
30 − 3B + B = 24
2B = 6
B=3
Replace B in A,
A = 10 − 3 = 7

Mathematics for Management Linear Programming


From C1,
A + B = 10
A = 10 − B
Replace A in C2,
3(10 − B) + B = 24
30 − 3B + B = 24
2B = 6
B=3
Replace B in A,
A = 10 − 3 = 7

∴ Optimal Solution = (7, 3)

Mathematics for Management Linear Programming


Optimal Value: 3(7) + 2(3) = 27
Mathematics for Management Linear Programming
Exercise 1:

Max 300D + 500W


s.t.

D≤4
2W ≤ 12
3D + 2W ≤ 18
D, W ≥ 0

Mathematics for Management Linear Programming


Exercise 2:

Max 10S + 9D
s.t.
7
S + D ≤ 630
10

1 5
S + D ≤ 600
2 6

2
S + D ≤ 708
3

1 1
S + D ≤ 135 S, D ≥ 0
10 4

Mathematics for Management Linear Programming


Example 2:

Minimize (Min) 8X + 12Y


s.t.

X + 3Y ≥ 9
2X + 2Y ≥ 10
6X + 2Y ≥ 18
X, Y ≥ 0

Mathematics for Management Linear Programming


Solution:

Mathematics for Management Linear Programming


Exercise 3:

Min 10X + 30Y


s.t.

2X + Y ≥ 16
X + Y ≥ 12
X + 2Y ≥ 14
X, Y ≥ 0

Mathematics for Management Linear Programming


Exercise 4:

Min 400X + 100Y


s.t.

3X + Y ≥ 24
X + Y ≥ 16
X + 3Y ≥ 30
X, Y ≥ 0

Mathematics for Management Linear Programming

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy