Scribd
Upload
23 views1 page

Ar, As, Ae, BR, BS, Be

Uploaded by

Ralph Parducho

This document contains two optimization problems. The first problem maximizes Z = 400R + 3000N by choosing values for R and N, subject to the constraints R + N > 15, R + N < 19, 4000R + 6000N < 72000, 1.25R - N > 0, R > 2, N > 2, and R and N being positive integers. The second problem minimizes Z = 1120AR + 1120AS +1120AE + 1200BR +1200BS +1200BE by choosing values for AR, AS, AE, BR, BS, and BE, subject to the constraints AR + BR = 1000, AS + BS = 2000, AE + BE = 2000, and several in

Copyright:

© All Rights Reserved
Download as PDF, TXT or read online from Scribd
Download as pdf or txt

Ar, As, Ae, BR, BS, Be

Uploaded by

Ralph Parducho
23 views1 page
This document contains two optimization problems. The first problem maximizes Z = 400R + 3000N by choosing values for R and N, subject to the constraints R + N > 15, R + N < 19, 4000R + 6000N < 72000, 1.25R - N > 0, R > 2, N > 2, and R and N being positive integers. The second problem minimizes Z = 1120AR + 1120AS +1120AE + 1200BR +1200BS +1200BE by choosing values for AR, AS, AE, BR, BS, and BE, subject to the constraints AR + BR = 1000, AS + BS = 2000, AE + BE = 2000, and several in

Original Description:

answers OR

Original Title

OR

Copyright

© © All Rights Reserved

Available Formats

PDF, TXT or read online from Scribd

Did you find this document useful?

Is this content inappropriate?

This document contains two optimization problems. The first problem maximizes Z = 400R + 3000N by choosing values for R and N, subject to the constraints R + N > 15, R + N < 19, 4000R + 6000N < 72000, 1.25R - N > 0, R > 2, N > 2, and R and N being positive integers. The second problem minimizes Z = 1120AR + 1120AS +1120AE + 1200BR +1200BS +1200BE by choosing values for AR, AS, AE, BR, BS, and BE, subject to the constraints AR + BR = 1000, AS + BS = 2000, AE + BE = 2000, and several in

Copyright:

© All Rights Reserved
Download as PDF, TXT or read online from Scribd
Download as pdf or txt
23 views1 page

Ar, As, Ae, BR, BS, Be

Uploaded by

Ralph Parducho
This document contains two optimization problems. The first problem maximizes Z = 400R + 3000N by choosing values for R and N, subject to the constraints R + N > 15, R + N < 19, 4000R + 6000N < 72000, 1.25R - N > 0, R > 2, N > 2, and R and N being positive integers. The second problem minimizes Z = 1120AR + 1120AS +1120AE + 1200BR +1200BS +1200BE by choosing values for AR, AS, AE, BR, BS, and BE, subject to the constraints AR + BR = 1000, AS + BS = 2000, AE + BE = 2000, and several in

Copyright:

© All Rights Reserved
Download as PDF, TXT or read online from Scribd
Download as pdf or txt
You are on page 1/ 1

#5) Let R = number of radio ads to be placed

N = number of newspaper ads to be placed



Maximize Z = 0.20*2000R + 0.50*6000N
or Maximize Z = 400R + 3000N

Subject to R + N > 15
R + N s 19
4000R + 6000N s 72000
1.25R - N > 0
R > 2
N > 2
R, N > 0 (redundant), integer

#6)
Let AR = number of barrels of crude A to be used in Regular
AS = number of barrels of crude A to be used in Super
AE = number of barrels of crude A to be used in Extra
BR = number of barrels of crude B to be used in Regular
BS = number of barrels of crude B to be used in Super
BE = number of barrels of crude B to be used in Extra


Minimize Z = 1120AR + 1120AS +1120AE + 1200BR +1200BS +1200BE

Subject to AR + BR = 1000
AS + BS = 2000
AE + BE = 2000
0.14AR + 0.20BR > 110 (11 of 1000)
0.18AR + 0.24BR > 170 (17 of 1000)
0.14AS + 0.20BS > 260 (13 of 2000)
0.18AS + 0.24BS > 440 (22 of 2000)
0.14AR + 0.20BR > 340 (17 of 2000)
0.18AR + 0.24BR > 380 (19 of 2000)
AR, AS, AE, BR, BS, BE > 0, integer

You might also like