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": "4b216af9-3b30-4cc1-bab7-e3cb3eabf7d2"}, "_deposit": {"created_by": 45, "id": "5863", "owner": "45", "owners": [45], "owners_ext": {"displayname": "", "username": ""}, "pid": {"revision_id": 0, "type": "recid", "value": "5863"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/5863", "sets": ["user-uit"]}, "communities": ["uit"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "An EffectiveTechnique to Optimization", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "The purpose of this research is to find optimal solution of non-affine C1 function by\nmeans of constructing respective Lagrange multiplier function together with Fritz John and\nKarush-Kuhn- Tucker conditions. These conditions are relating to problems P and Q.\nProblem P is the minimization ofconvex functional value with the constrained set ofconvex\ninequalities. Problem Q is the minimization of convex functional value with the constrained\nset of convex inequalities, linear inequalities and convex equalities. Lagrange multiplier\nfunction method is well-known but its manipulation is rather complicated. An effective way\nto handle Lagrange function is presented, in this paper. It is more convenient and more\navailable than the Simplex method due to G.Dantzig. Most of the functions in this paper is\nnon-affine C1-functions. Moreover, some illustrative examples are also discussed where\nnecessary."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "Convex Function"}, {"interim": "Concave Function"}, {"interim": "Linear Programming"}, {"interim": "Convex Programming"}, {"interim": "Karush-Kuhn-Tucker conditions"}, {"interim": "Lagrange Function"}, {"interim": "Fritz-John conditions"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2020-10-26"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "An EffectiveTechnique to Optimization.pdf", "filesize": [{"value": "2.1 Mb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_0", "mimetype": "application/pdf", "size": 2100000.0, "url": {"url": "https://meral.edu.mm/record/5863/files/An EffectiveTechnique to Optimization.pdf"}, "version_id": "2e765250-dabe-4f17-baa7-0bf5d21be2ab"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_journal_title": "Research Journal on Engineering Technology and Applied Science", "subitem_pages": "162-169", "subitem_volume": "Volume 2.b"}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Daw Phyu Win Nw"}, {"subitem_authors_fullname": "Daw Ohnmar Kyu"}, {"subitem_authors_fullname": "Daw Aye Aye Thin"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Journal article"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2019-08-01"}, "item_title": "An EffectiveTechnique to Optimization", "item_type_id": "21", "owner": "45", "path": ["1596102427017"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000005863", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2020-10-26"}, "publish_date": "2020-10-26", "publish_status": "0", "recid": "5863", "relation": {}, "relation_version_is_last": true, "title": ["An EffectiveTechnique to Optimization"], "weko_shared_id": -1}
  1. University of Information Technology
  2. Faculty of Computing

An EffectiveTechnique to Optimization

http://hdl.handle.net/20.500.12678/0000005863
http://hdl.handle.net/20.500.12678/0000005863
f1bc3782-780e-48f1-a5fa-0228bc1162f6
4b216af9-3b30-4cc1-bab7-e3cb3eabf7d2
None
Preview
Name / File License Actions
An An EffectiveTechnique to Optimization.pdf (2.1 Mb)
license.icon
Publication type
Journal article
Upload type
Publication
Title
Title An EffectiveTechnique to Optimization
Language en
Publication date 2019-08-01
Authors
Daw Phyu Win Nw
Daw Ohnmar Kyu
Daw Aye Aye Thin
Description
The purpose of this research is to find optimal solution of non-affine C1 function by
means of constructing respective Lagrange multiplier function together with Fritz John and
Karush-Kuhn- Tucker conditions. These conditions are relating to problems P and Q.
Problem P is the minimization ofconvex functional value with the constrained set ofconvex
inequalities. Problem Q is the minimization of convex functional value with the constrained
set of convex inequalities, linear inequalities and convex equalities. Lagrange multiplier
function method is well-known but its manipulation is rather complicated. An effective way
to handle Lagrange function is presented, in this paper. It is more convenient and more
available than the Simplex method due to G.Dantzig. Most of the functions in this paper is
non-affine C1-functions. Moreover, some illustrative examples are also discussed where
necessary.
Keywords
Convex Function, Concave Function, Linear Programming, Convex Programming, Karush-Kuhn-Tucker conditions, Lagrange Function, Fritz-John conditions
Journal articles
Research Journal on Engineering Technology and Applied Science
162-169
Volume 2.b
Back
0
0
views
downloads
See details
Views Downloads

Versions

Ver.1 2020-10-26 16:19:12.400600
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