CASE STUDY IN OPTIMAL TELEVISION ADVERTS SELECTION AS KNAPSACK PROBLEM

E. Ivokhin and Almodars Barraq. Subhi Kaml
Additional contact information
E. Ivokhin: Киевский национальный университет имени Тараса Шевченка

Вестник Киевского национального университета имени Тараса Шевченко. Экономика., 2014, vol. 18, issue 159, 16-21

Abstract: Abstract : 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. Keywords: advertisements, integer programming, knapsack problem, fuzzy linear programming, sensitivity analysis.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://visnyk.socionet.ru/files/159_16-21.pdf

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:scn:pnoeeq:159a3

Access Statistics for this article

Вестник Киевского национального университета имени Тараса Шевченко. Экономика. is currently edited by Ганна Харламова

More articles in Вестник Киевского национального университета имени Тараса Шевченко. Экономика. from Socionet, Киевский национальный университет имени Тараса Шевченко
Bibliographic data for series maintained by Ганна Харламова ().