About | Help  
  
 
WebsterComputerMath
 
ABCDEFGHIJKLMNOPQRSTUVWXYZ
 
DaDbDcDdDeDfDgDhDiDjDkDlDmDnDoDpDqDrDsDtDuDvDwDxDyDz
 

DOMINANCE

Dominance - This is used in many contexts, but the general meaning is that something is uniformly better than something else. For example, consider two activities in a linear program , say j and k, such that:

  • j has greater cost: c_j >= c_k
  • j produces less of each requirement: A(i, j) <= A(i, k) for i such that we require A(i,.)x >= b_i
  • j consumes more of each resource: A(i, j) >= A(i, k) for i such that we require A(i,.)x <= b_i
  • j produces or consumes at the same rate of goods to be conserved: A(i, j) = A(i, k) for i such that we require A(i,.)x = b_i
Then, activity k dominates  activity j.