JavaScript is disabled for your browser. Some features of this site may not work without it.
  • About K
  • Academics
  • Admission
  • Alumni Relations
  • Giving to K
  • News & Events
  • Student Life
  • HORNET HIVE
  • ATHLETICS
  • SITEMAP
  • WEBMAIL
    • Login
    View Item 
    •   CACHE Homepage
    • Academic Departments, Programs, and SIPs
    • Mathematics
    • Mathematics Senior Integrated Projects
    • View Item
    •   CACHE Homepage
    • Academic Departments, Programs, and SIPs
    • Mathematics
    • Mathematics Senior Integrated Projects
    • View Item

    An Introduction to the Mathematical Theory of Linear Programming

    Thumbnail
    View/Open
    Searchable PDF / Kalamazoo College Only (2.930Mb)
    Date
    1964
    Author
    Priebe, Wolfgang H.
    Metadata
    Show full item record
    Abstract
    This paper is an attempt to provide a relatively self-contained and basic mathematical justification for the LP problem and the simplex method of solving it. The first two parts of the paper outline the aspects of the abstract concepts of vectors, vector spaces, matrices, and transformation which are important to the theoretical foundation of LP methods. Part III gives a concise mathematical statement of the general LP problem. Two examples are included to point out some practical applications and to show the methods which can be employed to convert a variety of problems and conditions to the form of the generally stated problem. Part IV introduces the concept of convexity and shows the importance it plays in LP theory. Several vital theorems are stated and proved. Part V describes the simplex method of solving a problem, theoretically verifies its workability, and uses the simplex method to constructively show that certain assumptions made in Part IV could indeed be made. Hence, Part V completes the theoretical foundation. Part VI shows how the theoretically verified simplex method can be turned into a mechanical computational procedure by explaining the simplex algorithm and tableau. Finally, an example problem is solved to help clarify the workings of the algorithm and tableau.
    URI
    http://hdl.handle.net/10920/20615
    Collections
    • Mathematics Senior Integrated Projects [270]

    Browse

    All of CACHECommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Login

    DSpace software copyright © 2002-2023  DuraSpace
    DSpace Express is a service operated by 
    Atmire NV
    Logo

    Kalamazoo College
    1200 Academy Street
    Kalamazoo Michigan 49006-3295
    USA
    Info 269-337-7000
    Admission 1-800-253-3602

    About K
    Academics
    Admission
    Alumni Relations
    Giving to K
    News & Events
    Student Life
    Sitemap
    Map & Directions
    Contacts
    Directories
    Nondiscrimination Policy
    Consumer Information
    Official disclaimer
    Search this site


    Academic Calendars
    Apply
    Bookstore
    Crisis Response
    Employment
    Library
    Registrar
    DSpace Express is a service operated by 
    Atmire NV