To solve the problem, we search for the best multilocus order corresponding to minimum of weighted sum of map lengths among non-conflicting orders, testing only those orders that fit the condition "shared markers must be in shared order" for any subgroup of mapping populations (Mester et al. 2003b, 2006, 2010; Korol et al. 2009).
The selected distribution type γ ^ is the one associated to the minimum of the weighted sum [see (24)].
The threshold t in Equation 1 defined as the value with the minimum of the weighted sum of variance of two classes σ ω 2 ( t ) will separate the overall histogram into two distinguished regions.
The selected angular distribution type is then the one associated with the minimum of the weighted sum, so that, instead of (20), the following is used: γ ^ = min γ { ω a s σ a s + ω a o a σ a o a }.
The problem is to find a feasible schedule that minimizes one of the following objective functions: (1) the maximum lateness of orders, (2) the number of vehicles used subject to the condition that the maximum lateness is minimum, (3) the weighted sum of the maximum lateness and the number of vehicles used.
In order to investigate the possible range that fluxes can take while yielding an optimal solution, flux variability analysis was conducted: For each v i : Maximize or Minimize v i. Subject to: S v = 0. v min, i ≤ v i ≤ v max, i c T v = c T v F B A ∑ i = 1 n w i | v i | = s o p t Where s opt is the minimum for the weighted sum of absolute flux found in the MTF optimization.
The optimal plate is characterized by the minimum value of the weighted sum of the compliances corresponding to the two kinds of loads.
In this approach, the conventional single level programming has been formulated using the weighted sum technique with the weight is equal to reciprocal of the distance between the maximum and minimum value of each decision makers.
Then, we apply this strategy to weighted sum rate maximization subject to minimum required rates and limited transmission power.
With this strategy, a heuristic method was designed to maximize the weighted sum rate subject to the minimum rate constraint and the power limit.
