dc.contributor.advisor | Alfred Murray | |

dc.contributor.author | War, Thomas | |

dc.date.accessioned | 2020-04-30T10:08:47Z | |

dc.date.available | 2020-04-30T10:08:47Z | |

dc.date.issued | 1967-04-01 | |

dc.identifier.uri | https://scholars.carroll.edu/handle/20.500.12647/3498 | |

dc.description.abstract | Programming problems are concerned with the efficient use or allocation of limited resources to meet desired objectives. These problems are characterized by a large number of solutions that satisfy the basic conditions of each problem. However, the over-all objective of the problem requires the selection of a particular solution and this solution which satisfies both the conditions of the problem and the given objective is the optimal solution. In this paper only a very special subclass of programming problems, referred to as linear programming problems, will be considered. The general linear programming problem can be described as follows: Given a set of m linear inequalities in n variables, we wish to find non-negative values of these variables which will satisfy the constraints or conditions and minimize ( maximize ) some linear function of the variables. | |

dc.title | Basic Concepts In The Simplex Method Of Linear Programming | |

dc.type | thesis | |

carrollscholars.object.degree | Bachelor's | |

carrollscholars.object.department | Mathematics, Engineering & Computer Science | |

carrollscholars.object.disciplines | Applied Mathematics; Computer Sciences | |

carrollscholars.legacy.itemurl | https://scholars.carroll.edu/mathengcompsci_theses/122 | |

carrollscholars.legacy.contextkey | 12914892 | |

carrollscholars.object.season | Spring | |

dc.date.embargo | 12/31/1899 0:00 | |