Two Square Determinant Approach for Simplex Method
| dc.contributor.author | Jervin Zen Lobo | |
| dc.date.accessioned | 2026-03-30T04:53:47Z | |
| dc.date.issued | 2015-10-31 | |
| dc.description.abstract | Linear Programming Problems have been solved using traditional Algorithms of Simplex Methods. In this paper a modified approach to Simplex Method has been worked upon. This approach involves a determinant at every step to perform the next iteration till the optimum solution is obtained. | |
| dc.identifier.issn | 2319-765X | |
| dc.identifier.other | E-ISSN: 2278-5728 | |
| dc.identifier.uri | https://sxcgoa.ndl.gov.in/handle/123456789/35 | |
| dc.language.iso | en | |
| dc.publisher | IOSR Journal of Mathematics | |
| dc.relation.ispartofseries | Volumr:11; No.:05 | |
| dc.subject | Constraints | |
| dc.subject | Determinant | |
| dc.subject | Feasible Solution | |
| dc.subject | Linear Programming Problem | |
| dc.subject | optimum Solution | |
| dc.subject | Pivot | |
| dc.subject | Simplex Method | |
| dc.subject | Slack Variables | |
| dc.subject | Surplus Variables. | |
| dc.title | Two Square Determinant Approach for Simplex Method | |
| dc.type | Article |