# banga

This preview shows pages 1–3. Sign up to view the full content.

Running head :LINEAR PROGRAMMING 1 Linear Programming Name Institution Date

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
LINEAR PROGRAMMING 2 Assume that the number of the ads through the dispatch, magazines and the television in the city be: 3.5x 1 +x 2 and x 3 respectively Let the number of the ads through the dispatch, trade magazines and TV in the North West suburbs be y 1 ,y 2 and y 3 respectively. Therefore, the required objective function is: Minimize: 3.5x 1 +0.5x 2 +5x 3 >50 3y 1 +y 2 +3y 3 >60 1000(x 1 +y 1 ) <0.45[1000(x 1 +y 1 ) +300(x 2 +y 2 ) +2000(x 3 +y 3 )] 300(x 1 +y 1 ) <0.45[1000(x 1 +y 1 ) +300(x 2 +y 2 ) +2000(x 3 +y 3 )] 2000(x
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern