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:
Online Access:http://bulletin-econom.univ.kiev.ua/wp-content/plugins/download-attachments/includes/download.php?id=1688
id doaj-3126a7da7c0645488d4582d0d9d4c65d
record_format Article
spelling doaj-3126a7da7c0645488d4582d0d9d4c65d2020-11-24T22:55:08ZdeuPublishing Center "Kyiv University"Vìsnik. Kiïvsʹkogo Nacìonalʹnogo Unìversitetu ìmenì Tarasa Ševčenka. Ekonomìka1728-26672079-908X2014-06-016159162110.17721/1728-2667.2014/159-6/3CASE STUDY IN OPTIMAL TELEVISION ADVERTS SELECTION AS KNAPSACK PROBLEME. Ivokhin0Almodars Barraq Subhi Kaml1Taras Shevchenko National University of Kyiv, KyivTaras Shevchenko National University of Kyiv, KyivIn 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. http://bulletin-econom.univ.kiev.ua/wp-content/plugins/download-attachments/includes/download.php?id=1688advertisementsinteger programmingknapsack problemfuzzy linear programmingsensitivity analysis
collection DOAJ
language deu
format Article
sources DOAJ
author E. Ivokhin
Almodars Barraq Subhi Kaml
spellingShingle E. Ivokhin
Almodars Barraq Subhi Kaml
CASE STUDY IN OPTIMAL TELEVISION ADVERTS SELECTION AS KNAPSACK PROBLEM
Vìsnik. Kiïvsʹkogo Nacìonalʹnogo Unìversitetu ìmenì Tarasa Ševčenka. Ekonomìka
advertisements
integer programming
knapsack problem
fuzzy linear programming
sensitivity analysis
author_facet E. Ivokhin
Almodars Barraq Subhi Kaml
author_sort E. Ivokhin
title CASE STUDY IN OPTIMAL TELEVISION ADVERTS SELECTION AS KNAPSACK PROBLEM
title_short CASE STUDY IN OPTIMAL TELEVISION ADVERTS SELECTION AS KNAPSACK PROBLEM
title_full CASE STUDY IN OPTIMAL TELEVISION ADVERTS SELECTION AS KNAPSACK PROBLEM
title_fullStr CASE STUDY IN OPTIMAL TELEVISION ADVERTS SELECTION AS KNAPSACK PROBLEM
title_full_unstemmed CASE STUDY IN OPTIMAL TELEVISION ADVERTS SELECTION AS KNAPSACK PROBLEM
title_sort case study in optimal television adverts selection as knapsack problem
publisher Publishing Center "Kyiv University"
series Vìsnik. Kiïvsʹkogo Nacìonalʹnogo Unìversitetu ìmenì Tarasa Ševčenka. Ekonomìka
issn 1728-2667
2079-908X
publishDate 2014-06-01
description 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.
topic advertisements
integer programming
knapsack problem
fuzzy linear programming
sensitivity analysis
url http://bulletin-econom.univ.kiev.ua/wp-content/plugins/download-attachments/includes/download.php?id=1688
work_keys_str_mv AT eivokhin casestudyinoptimaltelevisionadvertsselectionasknapsackproblem
AT almodarsbarraqsubhikaml casestudyinoptimaltelevisionadvertsselectionasknapsackproblem
_version_ 1725657797802065920