Some Specific Applications of Disjunctive Programming Problems

Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 181)


In Chapter I we discussed in general the major applications of disjunctive programming problems. These included the generalized lattice point and related problems, the cardinality constrained problem, the extreme point programming problem and the binary mixed integer linear programming problem. In this chapter, we will present some specific applications which are subsumed under these general classes of problems.


Programming Problem Extreme Point Fixed Charge Basic Feasible Solution Disjunctive Programming 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  1. 1.School of Industrial Engineering and Operations ResearchVirginia Polytechnic Institute and State UniversityBlacksburgUSA
  2. 2.School of Industrial and Systems EngineeringGeorgia Institute of TechnologyAtlantaUSA

Personalised recommendations