Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
154 views

Project 3 - Linear Programming

Part A) Defines the variables, objectives, and constraints of an optimization problem to minimize cost for producing two menus over 12 weeks using three different production facilities with different weekly costs and output capacities. Part B) Uses only Facility A for 12 weeks at a cost of $12,000 to meet the output objectives while satisfying all constraints. Part C) Notes that changing the parameters or constraints requires reevaluating the optimal solution. The current minimum cost solution uses only Facility A.

Uploaded by

api-285465203
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
154 views

Project 3 - Linear Programming

Part A) Defines the variables, objectives, and constraints of an optimization problem to minimize cost for producing two menus over 12 weeks using three different production facilities with different weekly costs and output capacities. Part B) Uses only Facility A for 12 weeks at a cost of $12,000 to meet the output objectives while satisfying all constraints. Part C) Notes that changing the parameters or constraints requires reevaluating the optimal solution. The current minimum cost solution uses only Facility A.

Uploaded by

api-285465203
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Part A)

Variables

# Newspaper Ads (N) 21


# Radio Ads (R) 13

Objectives

Maximum # of Exposures 230000

Constraints
Amount Used Maximum
Newspaper Ads 21 21
Radio Ads 13 28
Cost 6000 6000

Optimization Function - Max Exposures = 6000N+8000R


Constraints - 100N+300R<=6000
0<=N<=21
0<=R<=28

Part B)

A total of 21 newspaper ads and 13 radio ads were used.


Total cost for these ads was $6,000.
The number of exposures totaled 230,000.

Part C)

Variables

# Newspaper Ads (N) 20


# Radio Ads (R) 20

Objectives

Maximum # of Exposures 280000

Constraints
Amount Used Maximum
Newspaper Ads 20 20
Radio Ads 20 20
Cost 8000 8000

By increasing the budget to $8,000 and maximizing both


newspaper and radio ads at 20, a new total of 280,000
exposures occur.

Optimization Function - Max Exposures = 6000N+8000R


Constraints - 100N+300R<=8000
0<=N<=20
0<=R<=20

Part D)

By altering the constraints, the total amount of ads which


could be purchased changed. Increasing the budget and
allowing for 20 of each ad increased the number of
exposures by 50,000.
Part A)

Variables

# of Newspaper Ads (N) 0


# of Radio Ads (R) 6
# of TV Ads (T) 0

Objectives

Max # of Working Mothers 72

Constraints
Amount Used Newspaper Radio TV
Cost 12 2 2 4
Total Audience 126 30 21 54
Working Mothers 72 6 12 8

Budget 12
Available Audience 420

Optimization Function - Max Working Mothers = 6N+12R+8T


Constraints - 2N+2R+4T<=12 N>=0
30N+21R+54T<=420 R>=0
T>=0
Optimum number of working mothers will be 72,000 using 6 Radio
ads and no others

Part B)

Variables

# of Newspaper Ads (N) 6


# of Radio Ads (R) 0
# of TV Ads (T) 0

Objectives

Max # of Working Mothers 36

Constraints
Amount Used Newspaper Radio TV
Cost 12 2 2 4
Total Audience 180 30 21 54
Working Mothers 36 6 4 8

Budget 12
Available Audience 420

Optimization Function - Max Working Mothers = 6N+12R+8T


Constraints - 2N+2R+4T<=12 N>=0
30N+21R+54T<=420 R>=0
T>=0
Optimum number of working mothers will be 36,000 using 6
Newspaper ads and no others

Part C)

Variables

# of Newspaper Ads (N) 6


# of Radio Ads (R) 0
# of TV Ads (T) 0

Objectives

Max # of Working Mothers 24

Constraints
Amount Used Newspaper Radio TV
Cost 12 2 2 4
Total Audience 180 30 21 54
Working Mothers 24 4 4 8

Budget 12
Available Audience 420

Optimization Function - Max Working Mothers = 6N+12R+8T


Constraints - 2N+2R+4T<=12 N>=0
30N+21R+54T<=420 R>=0
T>=0
Optimum number of working mothers will be 24,000 using 6
Newspaper ads and no others

Part D)

In changing the parameters, the rules by which we can


purchase ads change as well. Learning that radio ads
only reached 4,000 working mothers, instead of our
initial assumption 12,000 caused us to realize we should
not solely use them. When any parameters are
changed, we must reevaluate the way we calculate our
outcomes.
Part A)
A B C
Variables I 200 200 400
II 100 200 100
# of weeks @ Facility A (A) 12 Cost / Week $ 1,000 $ 3,000 $ 4,000
# of weeks @ Facility B (B) 0
# of weeks @ Facility C (C) 0

Objectives

Minimum Cost $ 12,000 200A+200B+400C >= 2000


100A+200B+100C >= 1200
Constraints A >=0
Amount Used Minimum B >=0
Menu I - Ceylonese 2400 2000 C >=0
Menu II - Bengali 1200 1200
Cost Per Week $ 12,000

Part C)

In minimizing the constraints, the problem is initially set up


in the same way. We try to minimize the final cost by
selecting the least expensive combinatition of inputs for the
desired output. The minimum cost Amir can fill his orders at
is $12,000 using only the production facility in the Avenues.

You might also like