WEKO3
アイテム
多目的計画法について
https://ous.repo.nii.ac.jp/records/633
https://ous.repo.nii.ac.jp/records/6334ec9477c-a17c-41b0-aa77-19040c3622c5
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
KJ00000063186.pdf (650.2 kB)
|
|
| Item type | 紀要論文(ELS) / Departmental Bulletin Paper(1) | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 1982-03-05 | |||||||||||
| タイトル | ||||||||||||
| タイトル | 多目的計画法について | |||||||||||
| 言語 | ja | |||||||||||
| タイトル | ||||||||||||
| タイトル | Some Comments for Multicriteria Linear Programming | |||||||||||
| 言語 | en | |||||||||||
| タイトル | ||||||||||||
| タイトル | タモクテキ ケイカクホウ ニツイテ | |||||||||||
| 言語 | ja-Kana | |||||||||||
| 言語 | ||||||||||||
| 言語 | jpn | |||||||||||
| 資源タイプ | ||||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||||
| 資源タイプ | departmental bulletin paper | |||||||||||
| ページ属性 | ||||||||||||
| 内容記述タイプ | Other | |||||||||||
| 内容記述 | P(論文) | |||||||||||
| 著者名 |
成久, 洋之
× 成久, 洋之
|
|||||||||||
| 著者所属(日) | ||||||||||||
| ja | ||||||||||||
| 岡山理科大学教養部 | ||||||||||||
| 著者所属(英) | ||||||||||||
| en | ||||||||||||
| Department of General Education, Okayama University of Science | ||||||||||||
| 抄録(英) | ||||||||||||
| 内容記述タイプ | Other | |||||||||||
| 内容記述 | Multicriteria programming problems treat the optimization which have multiple objectives within the programs. In realistic point of view, these kinds of multiple-criteria programming may be natural formulation of human decision-making processes for actual social and economical phenomena. However, the theory of these multiple-criteria decision-making is more difficult comparing with the single objective optimization. The multicriteria programming problems may be formulated as the vector optimization problems. Therefore, if any weights among these objectives are given, we can treat it as the single objective linear programs. Of course, these weights can not be given apriori. Because, we can not perform the exact trade-off between the given objectives. Consequently, it is very important to analyse the relation between the set of weights for the given objectives and the efficient solutions for the given optimization problems. In this paper, we present the solving procedure for multiple objective linear programming problems by applying the simplex method using the decomposition of a parametric space. | |||||||||||
| 言語 | en | |||||||||||
| 雑誌書誌ID | ||||||||||||
| 収録物識別子タイプ | NCID | |||||||||||
| 収録物識別子 | AN00033244 | |||||||||||
| 書誌情報 |
ja : 岡山理科大学紀要. A, 自然科学 en : The Bulletin of the Okayama University of Science, A, Natural Science 巻 17, p. 9-23, 発行日 1982-03-05 |
|||||||||||
