Logo Logo

Multiple Working Bases for Generalized and Variable Upper Bounding Linear Programs

Abstract

Special structures are usually noticed when a linear program represents a large scale system of inequalities associated with a management application. Such models are formulated frequently when describing production or capital budgeting problems. These linear programs of specific structures may contain both generalized upper bounding (GUB) and/or variable upper bounding (VUB) constraints. A variant of the revised simplex method is provided in this chapter for these types of linear programs so that the basis size is reduced. Based on some theoretical results derived, a special algorithm using two working bases is provided for pivoting, pricing, and inverting. Its implementation is shown to be computationally efficient.

Type

Book Chapter

Author(s)

Amorosu B Agbadudu, Bala Balachandran

Date Published

1998

Citations

Agbadudu, B Amorosu, and Bala Balachandran. 1998. Multiple Working Bases for Generalized and Variable Upper Bounding Linear Programs.

KELLOGG INSIGHT

Explore leading research and ideas

Find articles, podcast episodes, and videos that spark ideas in lifelong learners, and inspire those looking to advance in their careers.
learn more

COURSE CATALOG

Review Courses & Schedules

Access information about specific courses and their schedules by viewing the interactive course scheduler tool.
LEARN MORE

DEGREE PROGRAMS

Discover the path to your goals

Whether you choose our Full-Time, Part-Time or Executive MBA program, you’ll enjoy the same unparalleled education, exceptional faculty and distinctive culture.
learn more