Scribd
Upload
331 views2 pages

Linear Programming Example

A cold drinks company has three bottling plants that each produce three different drinks. The document provides the daily production capacities for each plant and drink. It also provides the monthly market demand for each drink. The objective is to minimize production costs by determining the optimal number of days each plant should run to meet demand, given the daily operating costs for each plant. This is formulated as a linear programming problem to find the values of x1, x2, x3 that minimize the total cost Z = 600x1 + 400x2 + 500x3, while meeting the demand constraints.

Uploaded by

Heather Chelle Montefalco
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
331 views2 pages

Linear Programming Example

A cold drinks company has three bottling plants that each produce three different drinks. The document provides the daily production capacities for each plant and drink. It also provides the monthly market demand for each drink. The objective is to minimize production costs by determining the optimal number of days each plant should run to meet demand, given the daily operating costs for each plant. This is formulated as a linear programming problem to find the values of x1, x2, x3 that minimize the total cost Z = 600x1 + 400x2 + 500x3, while meeting the demand constraints.

Uploaded by

Heather Chelle Montefalco
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

A cold drinks company has three bottling plants, located at two different places.

Each plants produces three different drinks. A, B, and


C. the capacities of the three plants, in number of bottles per day are as follows:

Product A Product B Product C


Plant 1 3,000 1,000 2,000
Plant 2 1,000 1,000 4,000
Plant 3 2,000 500 3,000

A market survey indicates that during any particular month there will be a demand of 24,000 bottles of Product A; 16,000 bottles of
Product B and 48,000 bottles of Product C. The operating costs per day of running plants 1, 2, and 3 are respectively Rs. 600, Rs. 400,
and Rs. 500. Formulate it as linear programming problem to find the number of days should the company run each plant during the
particular month so that the production cost is minimized while still meeting the market demand.

Solution:

Let, x 1 = No. of days for running plant 1

x 2 = No. of days for running plant 2

x 3 = No. of days for running plant 3

The amount of product A produced by three plants is

3,000 x 1+ 1,000 x 2+2,000 x 3

The amount of product B produced by three plants is

1,000 x 1+1,000 x 2+500 x 3

The amount of product C produced by three plants is

2,000 x 1+4,000 x 2+3,000 x 3

The demand of product A is 24,000 bottles. We want to find x 1, x 2, x 3such that the market demand must be fulfilled. Therefore, we
must have

3,000 x 1+ 1,000 x 2+2,000 x 3 ≥ 24,000

For the Product B is 16,000 bottles

1,000 x 1+1,000 x 2+500 x 3 ≥ 16,000

For the Product C is 48, 000 bottles

2,000 x 1+4,000 x 2+3,000 x 3 ≥ 48,000

As the number of days cannot be negative, therefore, we must have

x 1≥0, x 2≥0, x 3≥0


Total cost of running the Plants 1, 2, and 3 is

600 x 1+400 x 2+500 x 3

We are interested in minimizing the total cost. Hence, the linear programming problem can be formulated as:
Minimize: Z= 600 x 1+400 x 2+500 x 3

Minimize value or Optimal Solution of Z= 600 x 1+400 x 2+500 x 3 is Z= 7,200 with x 1=4, x 2=12, x 3=0

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