Key points are not available for this paper at this time.
Abstract A fundamental unsolved problem in the programming area is one in which various activities have fixed charges (e.g., set‐up time charges) if operating at a positive level. Properties of a general solution to this type problem are discussed in this paper. Under special circumstances it is shown that a fixed charge problem can be reduced to an ordinary linear programming problem.
Hirsch et al. (Sun,) studied this question.