Deneme Sınavı Soruları

It concerns sequences of events ruled by probability laws.

It is defined on a given probability space.

It maps the set of all possible outcomes in an experiment into the real numbers.

It describes the behavior of a system operating over some period of times.

It  has a special property that probabilities indicating how the process will evolve
in the future.

A transportation problem is a linear optimization problem, which seeks to minimize the total costs of shipment of items from certain origins to a number of destinations while fulfilling the requirements of destinations and emptying the origins.

Some transportation problems may be less restrictive; the total supply may exceed aggregate demand.

This model has the origin locations from where a single unit can be transported to a dedicated destination, and vice versa—the model has the destinations to which a single unit is sent solely from one origin location.

The decision variables of this problem are the amounts to be shipped for each origin-destination pairs.

A transportation problem has a feasible solution only if the total availability meets all the requirements.

4

5

6

7

8

The difference is that the constraints of the transportation model are in the form of equality. Thus, the duality relation here is asymmetric.

For the problem of the production decision, a counterpart actor was assumed as if it provided a purchasing alternative.

The original problem is to select the most economical distribution routes that meet the demands of the destinations.

Total cost of the shipment depends on total costs of transportation for the selected routes.

Dual transportation model is a transportation model, where the supply and demand constraints are equality, and the total supply equals total demand. 

141

149

157

165

168

Strategy

Player

Game

Pay-off

Saddle point

Identify the smallest value of each row for the cost matrix of the assignment problem. Subtract each row’s smallest value from all the costs in the respective row.

Identify the smallest value of each column for this altered matrix. Subtract each column’s smallest value from all the costs in the respective column

Mask the columns and rows out that have a zero value. The number of masked out rows and columns must be at a maximum.

If the number of masked out rows and columns is equal to n, then the optimum can be obtained from the present matrix; move on to the next step. If not, skip to Step 6.

Identify the optimal solution by the coordinates of the zero-valued elements in the present matrix.

Strategy

Player

Organization

Pay-off

Saddle point

Strategy

Players

Pay-off

Pay-off matrix

Hawk-Dove

100

110

150

170

430

A minimization problem using criterion of realism method.

A maximization problem using criterion of realism method.

A minimization problem using criterion of pessimism method.

A maximization problem using criterion of pessimism method.

A minimization problem using criterion of optimism method.

Proportionality

Constraint

Additivity

Feasibility

Certainty

Equally Likely

Criterion of Optimism

Criterion of Pessimism

Criterion of Realism

Minimax regret

Decision Making Under Risk

Decision Making Under Certainty

Decision Making Under Uncertainty

Decision Making Process

Scarce Source

Expected Monetary Value 

Expected Opportunity Loss 

Expected Regret

Maximum Probability

Expected Value of Perfect Information

Defining the problem

Establishing objectives

Listing all possible decision alternatives

Identifying the possible outcomes for each decision alternative

Identifying the pay-off matrix for each combination of alternatives 

There is no solution area for this problem.

The solution area is in the second quadrant of the coordinate plane.

The origin is not inside the feasible region.

The point (2,2) is inside the feasible region.

The objective function for this linear program is 5x₁ + 6x₂ = 30.