このアイテムのアクセス数: 55

このアイテムのファイル:
ファイル 記述 サイズフォーマット 
mfeku_37_4_264.pdf294.28 kBAdobe PDF見る/開く
完全メタデータレコード
DCフィールド言語
dc.contributor.authorITAKURA, Hidekiyoen
dc.contributor.authorNISHIKAWA, Yoshikazuen
dc.date.accessioned2023-03-28T09:06:56Z-
dc.date.available2023-03-28T09:06:56Z-
dc.date.issued1975-12-31-
dc.identifier.urihttp://hdl.handle.net/2433/280988-
dc.description.abstractIn an optimization of a real system planning or design, when a prescribed set of constraints is found infeasible, it needs to be modified somehow. This paper presents a method for making an in feasible set of linear programming constraints feasible. Infeasibility is detected in phase I of the two-phase simplex procedure. Numerical data in the final simplex tableau of phase I are used for relaxing in feasibility. The relaxation is carried out by modifying some upper or lower bounds of the constraints. A sufficient condition for the relaxation is derived. The method allows a wide variety of modifications of the constraints. Thus, it could effectively be used in a practical linear programming design.en
dc.language.isoeng-
dc.publisherFaculty of Engineering, Kyoto Universityen
dc.publisher.alternative京都大学工学部ja
dc.subject.ndc500-
dc.titleOn Relaxation of Infeasibility of Linear Programming Constraintsen
dc.typedepartmental bulletin paper-
dc.type.niitypeDepartmental Bulletin Paper-
dc.identifier.ncidAA00732503-
dc.identifier.jtitleMemoirs of the Faculty of Engineering, Kyoto Universityen
dc.identifier.volume37-
dc.identifier.issue4-
dc.identifier.spage264-
dc.identifier.epage270-
dc.textversionpublisher-
dc.sortkey05-
dc.addressDepartment of Electrical Engineeringen
dc.addressDepartment of Electrical Engineeringen
dcterms.accessRightsopen access-
dc.identifier.pissn0023-6063-
出現コレクション:Vol.37 Part 4

アイテムの簡略レコードを表示する

Export to RefWorks


出力フォーマット 


このリポジトリに保管されているアイテムはすべて著作権により保護されています。