Jointly constrained order quantities with all-units discounts

In this article we investigate situations where the buyer is offered discounted price schedules from alternative vendors. Given various discount schedules, the buyer must make the best buying decision under a variety of constraints, such as limited storage space and restricted inventory budgets. Solutions to this problem can be utilized by the buyer to improve profitability. EOQ models for multiple products with all-units discounts are readily solvable in the absence of constraints spanning the products. However, constrained discounted EOQ models lack convenient mathematical properties. Relaxing the product-spanning constraints produces a dual problem that is separable, but lack of convexity and smoothness opens the door for duality gaps. In this research we present a set of algorithms that collectively find the optimal order vector. Finally, we present numerical examples using actual data. to illustrate the application of the algorithms. © 1993 John Wiley & Sons, Inc.     

‘A Time of War’: contextual and organisational dimensions in the construction of combat motivation in the IDF

This paper explores the construction of combat motivation in the Israel Defense Forces (IDF), arguing that although Israeli society at large is in a ‘Post Heroic’ era, the ‘Heroic Spirit’ is revealed during emergencies. A total of 1535 questionnaires were administered among combat soldiers during large-scale operations fought during national emergency and during small-scale routine operations. The results reveal differences in the construction of combat motivation typical for emergency vs. routine, as well as for reserves vs. regular units. These results indicate that the Post Heroic era is a condition that could be shifted according to cultural, organisational and individual determinants. This paper discusses the roots of these constructions and their implications on the theory of combat motivation and combat experience.     

Adjacent vertices on transportation polytopes

To solve linear fixed charge problems with Murty's vertex ranking algorithm, one uses a simplex algorithm and a procedure to determine the vertices adjacent to a given vertex. In solving fixed charge transportation problems, the simplex algorithm simplifies to the stepping-stone algorithm. To find adjacent vertices on transportation polytopes, we present a procedure which is a simplification of a more general procedure for arbitrary polytopes.