Optimal Advert Placement Slot Using Knapsack Model: A Case Study: Television Advertisement of TV 3

Thumbnail Image
Journal Title
Journal ISSN
Volume Title
The study was about how to model the TV 3 adverts selection problems as 0 – 1 single knapsack problem so as to maximize the returns from their commercials. Knapsack problem model is a general resource allocation model in which a single resource is assigned to a number of alternatives with the aim of maximizing the total return. In this work, the researcher obtained the data on TV 3 adverts from the following zones: A1: TV 3 News 360 (19:00 hours GMT), A4: Music – Music (20 : 30 – 21:30 GMT ) every Saturday. A9: Mid Day Live (12 : 00 – 12 : 30 GMT ) Dynamic programming algorithm was used to solve the problem. To carry out the computations, the computer software, matlab was used to analyse the problem. The computational results showed that the optimal incomes of adverts from TV 3 News 360, Music – Music and Mid – Day Live programmes are Gh ¢30,005.00, Gh ¢15,696.00 and Gh ¢ 4,675.20 respective.
A Thesis submitted to the Department of Mathematics, Kwame Nkrumah University of Science and Technology in partial fulfillment of the requirements for the degree of Master of Science