Satu Pendekatan Geometri Bagi Masalah Pengaturcaraan Linear
Kaedah simpleks adalah kaedah yang paling termasyhur bagi menyelesaikan masalah pengaturcaraan linear. Kaedah ini menjelmakan masalah asal pengaturcaraan linear kepada bentuk kanonikal dengan bantuan pembolehubah tambahan, sama ada pembolehubah lalai, lebihan atau pembolehubah buatan. Dengan de...
Saved in:
Main Author: | Jaafar, Azmi |
---|---|
Format: | Thesis |
Language: | English Malay |
Published: |
1997
|
Subjects: | |
Online Access: | http://psasir.upm.edu.my/id/eprint/8622/1/FSAS_1997_7_A.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Analytical Approach for Linear Programming Using Barrier and Penalty Function Methods
by: Moengin, Parwadi
Published: (2003) -
An implementation of an interior point method for extended linear-quadratic programming /
by: Wee, Kwan Eng
Published: (1995) -
Consistency techniques for linear arithmetic and functional constraints /
by: Zhang, Yuanlin
Published: (1998) -
Linear programming approach for scheduling sports league problems in Malaysia
by: Ahmad Rosdi, Muhammad Ifwat
Published: (2017) -
Linear programming planning model for Malaysian agricultural sector /
by: Kong, Yeng Kin
Published: (1977)