CASE STUDY IN OPTIMAL TELEVISION ADVERTS SELECTION AS KNAPSACK PROBLEM

CASE STUDY IN OPTIMAL TELEVISION ADVERTS SELECTION AS KNAPSACK PROBLEM

In this research paper, we shall consider the application of classical 0-1 knapsack problem with a single constraint to selection of television advertisements at critical periods such as prime time news, news adjacencies, break in news and peak times using the WINQSB software. In the end of this pap...

Full description

Bibliographic Details
Main Authors: E. Ivokhin, Almodars Barraq Subhi Kaml
Format: Article
Language:deu
Published: Publishing Center "Kyiv University" 2014-06-01
Series:Vìsnik. Kiïvsʹkogo Nacìonalʹnogo Unìversitetu ìmenì Tarasa Ševčenka. Ekonomìka
Subjects:
advertisements
integer programming
knapsack problem
fuzzy linear programming
sensitivity analysis
Online Access:http://bulletin-econom.univ.kiev.ua/wp-content/plugins/download-attachments/includes/download.php?id=1688
Description
Summary:In this research paper, we shall consider the application of classical 0-1 knapsack problem with a single constraint to selection of television advertisements at critical periods such as prime time news, news adjacencies, break in news and peak times using the WINQSB software. In the end of this paper we shall formulate the task of investigation of the post optimality solution of optimal Television Adverts Selection with respect to time allocated for every group adverts.
ISSN:1728-2667
2079-908X

Similar Items