Log in
Language:

MERAL Myanmar Education Research and Learning Portal

  • Top
  • Universities
  • Ranking
To
lat lon distance
To

Field does not validate



Index Link

Index Tree

Please input email address.

WEKO

One fine body…

WEKO

One fine body…

Item

{"_buckets": {"deposit": "55d50c61-e1ba-48a0-bf72-f450c226d352"}, "_deposit": {"id": "4369", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "4369"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/4369", "sets": ["1597824304333", "user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Optimal Selection of Advertising Print-Media using Linear Programming", "subitem_1551255648112": "en_US"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Operation Research (OR) is aninterdisciplinary branch of applied mathematics andformal science that uses method like mathematicalmodeling, statistics and algorithms to arrive atoptimal or near optimal solution to complex problem.Linear Programming is widely used model type thatcan solve decision problem with thousands ofvariables in OR. The BIG-M method has approved tobe the most effective technique applicable to anyproblem in Linear Programming, and can beformulated in term of linear objective function,subject to a set of constraints. BIG-M can be used tohelp marketing manager allocate a fixed budget tovarious advertising media. In this paper, we analyzedthe basic concepts of Linear Programming and BIGM method, and applied BIG-M method with Simplexalgorithm in advertising media selection problem ofmarketing. The system produces the optimaladvertising media and advertisement times usingBIG-M method with Simplex algorithm according totarget budget and audience constraints. Theimplemented system is intended to help genericbusiness to find out the efficient advertising mediaand expense for their market."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value": []}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2019-10-15"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "NJPSC 2019 Proceedings-pages-126-130.pdf", "filesize": [{"value": "311 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 311000.0, "url": {"url": "https://meral.edu.mm/record/4369/files/NJPSC 2019 Proceedings-pages-126-130.pdf"}, "version_id": "0f2b72bc-4992-4d5a-a2da-2dbbf6609c71"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "National Journal of Parallel and Soft Computing", "subitem_pages": "", "subitem_volume": ""}]}, "item_1583103147082": {"attribute_name": "Conference papers", "attribute_value_mlt": [{"subitem_acronym": "", "subitem_c_date": "", "subitem_conference_title": "", "subitem_part": "", "subitem_place": "", "subitem_session": "", "subitem_website": ""}]}, "item_1583103211336": {"attribute_name": "Books/reports/chapters", "attribute_value_mlt": [{"subitem_book_title": "", "subitem_isbn": "", "subitem_pages": "", "subitem_place": "", "subitem_publisher": ""}]}, "item_1583103233624": {"attribute_name": "Thesis/dissertations", "attribute_value_mlt": [{"subitem_awarding_university": "", "subitem_supervisor(s)": [{"subitem_supervisor": ""}]}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Aye, Thaw Tar"}, {"subitem_authors_fullname": "Yee, Myint Myint"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Article"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2019-03"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/2307"}, "item_title": "Optimal Selection of Advertising Print-Media using Linear Programming", "item_type_id": "21", "owner": "1", "path": ["1597824304333"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000004369", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-10-15"}, "publish_date": "2019-10-15", "publish_status": "0", "recid": "4369", "relation": {}, "relation_version_is_last": true, "title": ["Optimal Selection of Advertising Print-Media using Linear Programming"], "weko_shared_id": -1}
  1. University of Computer Studies, Yangon
  2. Journals

Optimal Selection of Advertising Print-Media using Linear Programming

http://hdl.handle.net/20.500.12678/0000004369
http://hdl.handle.net/20.500.12678/0000004369
3739e9cb-6142-4152-aaad-c710179796f0
55d50c61-e1ba-48a0-bf72-f450c226d352
None
Preview
Name / File License Actions
NJPSC NJPSC 2019 Proceedings-pages-126-130.pdf (311 Kb)
Back
0
0
views
downloads
See details
Views Downloads

Versions

Ver.1 2020-09-01 14:35:40.090113
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Export

OAI-PMH
  • OAI-PMH DublinCore
Other Formats
  • JSON

Confirm


Back to MERAL


Back to MERAL