Scribd
Upload
44 views5 pages

ManSci Problem Solving

The document describes three optimization problems involving constraints and objective functions: 1. The minimum cost of operating two oil refineries given constraints on oil production. The optimal solution is 25 days for refinery 1 and 50 days for refinery 2 at a cost of $1,750,000. 2. The minimum cost of operating two steel mills given constraints on steel production. The optimal solution is 0 days for mill 1 and 311.25 days for mill 2 at a cost of $18,675,000. 3. Maximizing a student's test score given constraints on time and number of questions. The optimal solution is 3 essay questions and 30 short-answer questions for a score of 210.

Uploaded by

Sufea Posa
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
44 views5 pages

ManSci Problem Solving

The document describes three optimization problems involving constraints and objective functions: 1. The minimum cost of operating two oil refineries given constraints on oil production. The optimal solution is 25 days for refinery 1 and 50 days for refinery 2 at a cost of $1,750,000. 2. The minimum cost of operating two steel mills given constraints on steel production. The optimal solution is 0 days for mill 1 and 311.25 days for mill 2 at a cost of $18,675,000. 3. Maximizing a student's test score given constraints on time and number of questions. The optimal solution is 3 essay questions and 30 short-answer questions for a score of 210.

Uploaded by

Sufea Posa
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/ 5

ManSci Problem solving.

Almera P. Posa

Problem 1:

The number of days to run refinery 1 = x

The number of days to run refinery 2 = Y

YOUR OBJECTIVE FUNCTION:

20,000 * x + 25,000 * y which equals the total cost to provide the necessary amount of oil.

CONSTRAINT FUNCTIONS:

high grade oil requirements is 400x + 300y >= 25000

medium grade oil requirements is 300x + 400y >= 27000

low grade oil requirements is 200x +500y >= 30000

Since number of days can't be negative therefore, x,y >= 0

GRAPH:

The area of the graph that is not shaded is your region of feasibility.

The minimum cost will be found by evaluating the objective function at each optimum point of the
region of feasibility.
THE OPTIMUM POINTS:

are at (0,83.3333),(25,50),(150,0)

(0,83.3333), the cost is 0 * 20,000 + 83.33 * 25,000 = 2,083,250.

(25,50), the cost is 25 * 20,000 + 50 * 25,000 = 1,750,000.

(150,0), the cost is 150 * 20,000 + 0 * 25,000 = 3,000,000

The minimum cost is achieved when refinery 1 is operated for 25 days and refinery 2 is operated for 50
days at a cost of 1,750,000.

Problem 2

x = number of days to operate mill 1.

y = number of days to operate mill 2.

OBJECTIVE FUNCTION

Since Mill 1 costs $70,000 per day to operate and Mill 2 costs $60,000 per day to operate the
objective function would be:

70,000 * x + 60,000 * y.

CONSTRAINT FUNCTIONS:

Orders totaling 100,000 tons of high-grade steel therefore,


400x + 350y >= 100,000

150,000 tons of medium-grade steel therefore,


500x + 600y >= 150,000

a124,500 tons of low-grade steel therefore,


450x + 400y >= 124,500

The number of days can’t be negative,

x,y >= 0
The area on the graph that is not shaded is your region of feasibility.

THE OPTIMUM POINTS:

(0,311.25), (210,75), (300,0)

the cost at (0,311.25) is 0 * 70,000 + 311.25 * 60,000 = 18,675,000.

the cost at (310,75) is 210 * 70,000 + 75 * 60,000 = 19,200,000.

the cost at (300,0) is 300 * 70,000 + 0 * 60,000 = 21,000,000.

The minimum cost is when you run mill2 for 311.25 days.

All the constraint functions need to be met when x = 0 and y = 311.25

400x + 350y = 108937.5 which is > 100,000.

500x + 600y = 186,750 which is > 150,000.

450x + 400y = 124,500 which is e3qual to 124,500.

both x and y are > 0.


Therefore, all the constraint are met and the cost is minimum when x = 0 and y = 311.25.

Which means that mill 2 gets a lot of work and mill 1 doesn't get any.

Problem 3

Let x denote the number of multiple choice questions that Michael will attempt

Let y denote the number of essay questions that Michael will attempt.

OBJECTIVE FUNCTION

Since the essay questions are worth 20 points each and the short questions are worth 5
points each the objective function will be 5x + 20y.

CONSTRAINT FUNCTIONS:

2x + 10y<= 90 (time needed to answer the questions).

x >=0 (at least 10 short-answer questions).

x <= 50 (at most 50 short-answer questions).

y >= 3 (at least 3 essay questions).

y <= 10 (at least 3 essay questions).

GRAPH:

The lines x = 50 and y = 10 are outside the part of the plane shown is the feasible region.
The three vertices are (10, 3), (10, 7) and (30, 3). The values of the objective function are 60, 190 and
210. Hence Michael can maximize his score by answering 3 essay questions and 30 short-answer
questions.

You might also like