Linear programming and the Simplex method : an honors thesis [(HONRS 499)]

Cardinal Scholar

Show simple item record

dc.contributor.advisor McKinney, Earl H. en_US Tevis, Terri A. en_US 2011-06-06T19:27:59Z 2011-06-06T19:27:59Z 1980 en_US 1980
dc.identifier.other A-28 en_US
dc.description.abstract This thesis discusses the basic problems of solving a linear programming problem. A definition of the linear programming problem is stated.Basic linear algebra methods are necessary to solve a linear programming (LP) problem. A short synopsis of the necessary methods used are presented, including examples.The simplex algorithm is introduced and an example is used to demonstrate its applicability. A computer program is presented which utilizes the basic simplex algorithm and the extended tableau form.The problem of degeneracy as it affects the simplex method is explained. Research of more efficient programs are always in progress. The power of the simplex mehtod is evident in the business applications area.
dc.description.sponsorship Honors College
dc.format.extent 1 v. ; 29 cm. en_US
dc.source Virtual Press en_US
dc.subject.lcsh Computer science. en_US
dc.subject.lcsh Ball State University. Honors College -- Theses (B.?.) -- 1980. en_US
dc.title Linear programming and the Simplex method : an honors thesis [(HONRS 499)] en_US
dc.type Undergraduate senior honors thesis Thesis (B.?.)
dc.identifier.cardcat-url en_US

Files in this item

This item appears in the following Collection(s)

  • Undergraduate Honors Theses [5614]
    Honors theses submitted to the Honors College by Ball State University undergraduate students in partial fulfillment of degree requirements.

Show simple item record

Search Cardinal Scholar


My Account