Scribd
Upload
6 views3 pages

Linear Programming Problems Solutions

The document presents four optimization problems involving linear programming. The first problem focuses on maximizing profit from the production of two medicines, while the next three problems involve minimizing costs related to machine selection, food production, and chemical requirements. Each problem includes defined objective functions and constraints for decision variables.

Uploaded by

brupmita
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
6 views3 pages

Linear Programming Problems Solutions

The document presents four optimization problems involving linear programming. The first problem focuses on maximizing profit from the production of two medicines, while the next three problems involve minimizing costs related to machine selection, food production, and chemical requirements. Each problem includes defined objective functions and constraints for decision variables.

Uploaded by

brupmita
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/ 3

Question 1: Medicine Production (Maximize Profit)

Let:

x = 1000 bottles of Medicine A

y = 1000 bottles of Medicine B

Objective:

Maximize profit: Z = 8x + 7y

Subject to:

x + y <= 45

x <= 20

y <= 40

3x + y <= 66

x >= 0, y >= 0

Question 4: Machine Selection (Minimize Cost)

Let:

x = number of type A machines

y = number of type B machines

Objective:

Minimize cost: Z = 1000x + 1200y

Subject to:

x >= 3

y >= 1

1000x + 1200y <= 15000


4x + 5y <= 40

x >= 0, y >= 0

Question 16: Food Problem (Minimize Cost)

Let:

x = grams of Food X

y = grams of Food Y

Objective:

Minimize cost: Z = 12x + 22y

Subject to:

6x + 8y >= 100

7x + 12y >= 120

x >= 0, y >= 0

Question 17: Chemical Requirement (Minimize Cost)

Let:

x = number of liquid product jars

y = number of dry product cartons

Objective:

Minimize cost: Z = 3x + 2y

Subject to:

5x + y >= 10

2x + 2y >= 12
x + 4y >= 12

x >= 0, y >= 0

You might also like