INTRODUCTION TO LEADERSHIP, MOTIVATION, AND STRATEGIC HUMAN RESOURCE MANAGEMENT

By -
INTRODUCTION

Most definitions of leadership reflect the assumption that it involves a social influence process whereby intentional influence is exerted by one person over other people to structure the activities and relationships in a group or organization (Yukl 1998). Leadership occurs when one group member modifies the motivation and competencies of others in the group (Bass 1990). Work motivation is the willingness of an individual to invest energy in productive activity. Thus, leadership and moti- vation are interwoven, inseparable concepts; a core outcome of effective leadership is a higher will- ingness on the part of the employees to invest energy in performing their tasks. A new genre of leadership and motivation theories has been shown to affect organizational effectiveness in ways that are quantitatively greater than, and qualitatively different from, the effects specified by previous theories (House and Shamir 1993; for a meta-analytic review see Lowe et al. 1996). These theories have led to new applications in human resource management. As shown in Figure 1, we first review the early vs. the most recent paradigms of leadership, namely the shift from transactional to trans- formational, charismatic, or visionary leadership. This shift is manifested by changes in the bases for work motivation from an emphasis on calculative, individualistic, extrinsic, short-term motivators toward more expressive, collectivistic, intrinsic, long-term motivators. Taken together, these new approches have been shown to positively impact organizational outcomes, including performance and employee development. The impact of the new leadership and motivation paradigm on organizational outcomes has implications for strategic human resource management, specifically recruiting, perform- ance management, training and development, and compensation.

Comments

Post a Comment

Popular posts from this blog

DUALITY THEORY:THE ESSENCE OF DUALITY THEORY

By -
Image
THE ESSENCE OF DUALITY THEORY Given our standard form for the primal problem at the left (perhaps after conversion from another form), its dual problem has the form shown to the right. Thus, with the primal problem in maximizatio n form, the dual problem is in minimization form instead. Furthermore, the dual problem uses exactly the same pa r amete r s as the primal problem, but in different locations, as summarized below. 1. The coefficients in the objective function of the primal problem are the right-hand sides of the functional constraints in the dual problem. 2. The right-hand sides of the functional constraints in the primal problem are the coef- ficients in the objective function of the dual problem. 3. The coefficients of a variable in the functional constraints of the primal problem are the coefficients in a functional constraint of the dual problem. To highlight the comparison, now look at these same two problems in matrix notation (as introduced at the beginn...
Read more

NETWORK OPTIMIZATION MODELS:THE MINIMUM SPANNING TREE PROBLEM

By -
Image
THE MINIMUM SPANNING TREE PROBLEM The minimum spanning tree problem bears some similarities to the main version of the shortest-path problem presented in the preceding section. In both cases, an undi r ecte d and connected network is being considered, where the given information includes some mea- sure of the positive length (distance, cost, time, etc.) associated with each link. Both problems also involve choosing a set of links that have the shortest total length among all sets of links that satisfy a certain property. For the shortest-path problem, this property is that the chosen links must provide a path between the origin and the destination. For the minimum spanning tree problem, the required property is that the chosen links must provide a path between ea c h pair of nodes. The minimum spanning tree problem can be summarized as follows: 1. You are given the nodes of a network but not the links. Instead, you are given the po- tential links and the positive length for each ...
Read more

INTEGER PROGRAMMING:THE BRANCH-AND-CUT APPROACH TO SOLVING BIP PROBLEMS

By -
TH E BRANCH-AND-CUT APPROACH TO SOLVING BIP PROBLEMS Integer programming has been an especially exciting area of OR since the mid-1980s be- cause of the dramatic progress being made in its solution methodology. Background To place this progress into perspective, consider the historical background. One big break- through had come in the 1960s and early 1970s with the development and refinement of the branch-and-bound approach. But then the state of the art seemed to hit a plateau. Rel- atively small problems (well under 100 variables) could be solved very efficiently, but even a modest increase in problem size might cause an explosion in computation time be- yond feasible limits. Little progress was being made in overcoming this exponential growth in computation time as the problem size was increased. Many important problems arising in practice could not be solved. Then came the next breakthrough in the mid-1980s, with the introduction of the b r an c h- and-cu t approach to sol...
Read more