İŞLETME KARAR MODELLERİ - Deneme Sınavı - 2

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.

Iteration is a repetition of a mathematical procedure applied to the result of a previous application. An iterative algorithm aims to obtain successively closer approximations to the solution.

A basic solution—whether it is feasible or not—is a corner point of the solution space. The corner points of system of equations are obtained by setting n – m number of variables equal to zero and solving the equations for the remaining m number of variables.

The corner points of system of equations are obtained by setting n – m number of variables equal to zero and solving the equations for the remaining m number of variables.

The selection between the adjacent BF solutions is based on the improvement, not deterioration in Z. If there are many adjacent BF solutions that improve the Z, the one providing the largest improvement is selected. If none of the adjacent BF solutions improve Z, the current BF solution is optimal.

Artificial variables are dummy variables, which intend to initiate the iterations and leave from the basic variables as the operation iterates. This is provided by modifying the objective function with the artificial variables that have a large negative coefficient –M. Artificial variables are required to satisfy the non-negativity constraints and have no physical meaning in the real problem. Once an artificial variable leaves the basic variables, it can be omitted in the next iterations, since it will not be chosen against any other non-basic variable as an entering variable.

If a system has three equations (m=3) and five variables (n=5) then the number of basic solutions is 5!/(3!*(5-3)!) = 120/(6*2) = 120/12 = 10.

The steps of determining the pivotal row are given below: 1. Take each positive coefficient in the pivotal column. 2. Divide each of these into the right-hand side constant for the corresponding row. 3. Identify the row that has the minimum ratio. 4. Pivotal row is the row that is identified in the previous step.

If two corner-point feasible solutions are connected by a line segment, these cornerpoint feasible solutions are adjacent. Two corner-point feasible solutions are adjacent if all but one of their respective variables have the same value.

A slack or surplus is utilized to reconstruct a constraint to obtain equation format. A slack variable represents the remainder of an expendable resource and applies to less than or equal constraints. On the other hand, a surplus represents the excess amount of a restricted resource and applies to greater than or equal constraints.

The objective of minimizing Z is identical to maximizing -Z, and vice versa. Therefore, the maximization of -Z can be solved in substitute of minimization of Z.

Basic concepts of game theory include Players, Strategy, Pay-off and Pay-off matrix. Accordingly, the correct answer is E.

Strategy is a complete description of a player’s course of action during the game. Accordingly, the correct answer is B.

Pay-off refers to the numerical value which indicates the amount gained or lost by a player at the end of the game contingent upon the course of actions all of other players. Accordingly, the correct answer is C.