İŞLETME KARAR MODELLERİ

The dual model interchanges costs and constraints of the primal model, and converts the objective from maximization to minimization.

Strong duality property refers that the objective value of Z and the objective value of W are equal only if the basic feasible solution is the optimal for the primal as well as the dual model.

This property allows checking for the optimality of the primal solution by inspecting the feasibility of its dual solution.

The Least-cost method considers the respective costs of the variables so as to find a basic feasible solution that approximates the optimum solution more.

Vogel’s approximation method (VAM) can be regarded as an improved version of the least-cost method. Instead of using the direct cost of the transportation, VAM utilizes the concept of the penalty cost.

The Least-cost method considers the respective costs of the variables so as to find a basic feasible solution that approximates the optimum solution more. Unlike the Northwest Method, the Least- cost algorithm begins with selecting the route that has the smallest unit cost of transportation.

Northwest Corner Method: The first basic variable is the one that is at the northwest on the transportation tableau. The value allocated to this variable is the value of the smaller one of the supply and demand.

Least-cost Method: The Least-cost method considers the respective costs of the variables so as to find a basic feasible solution that approximates the optimum solution more. Unlike the Northwest Method, the Least- cost algorithm begins with selecting the route that has the smallest unit cost of transportation. If there is more than one variable that has the smallest cost, any variable among these can be selected arbitrarily.

The application is presented as a standalone method called the Modified Distribution Method (MODI). Also known as the method of simplex multipliers or the u-v method, MODI is a tailored version of the simplex method for the transportation model. MODI determines whether a basic feasible solution is optimal or not, and if not, identifies the entering variable.

In an assignment model, the origins and destinations are the workers and the jobs, respectively.