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.
No takes yet. Share an insight, caveat, or question.
Hirsch et al. (1968) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: