Throughput is an important performance consideration for multihop wireless networks. In this paper, we study the joint link scheduling and power control problem, focusing on maximizing the network throughput.We formulate the MAximum THroughput link Scheduling with Power Control (MATH-SPC) problem, and present a Mixed Integer Linear Programming (MILP) formulation to provide optimal solutions. However, simply maximizing the throughput leads to a severe bias on bandwidth allocation among all links. In order to enhance both throughput and fairness, we define a new parameter, the Demand Satisfaction Factor (DSF), to characterize the fairness of bandwidth allocation. We formulate the MAximum Throughput fAir link Scheduling with Power Control (MATA-SPC) problem and present an MILP formulation for this problem. We also present an effective polynomial time heuristic algorithm, namely, the Serial LP Rounding (SLPR) heuristic. Our numerical results show that bandwidth can be fairly allocated among all links/flows by solving our MATA-SPC formulation or using our heuristic algorithm at the cost of a minor reduction of network throughput.