Ünite Sınavı Soruları

1. Problem definition
2. System analysis for the problem and data gathering
3. Model construction
4. Model solution and testing
5. The decision of implementing the solution

What is the correct order of the definitive steps of operations research approach above?

1. Proportionality
2. Additivity
3. Divisibility
4. Certainty

What assumption/s does linear programming provide solutions under?

Who was the person/institution recognized as the first to explore the area of operations research?

1. The foundation of operations research is mostly cited to studies and applications in the U.S. Army right before The World War II.
2. Leonid V. Kantorovich is recognized as the first to explore operations research area.
3. In 1939, Kantorovich published a paper on a method for a production plan which he claimed to be the optimal way.
4. The systematic solution which is called “simplex algorithm” was introduced by George B. Dantzig, who had planning experience in the U.S. Army Air Force.
5. Tjalling C. Koopmans, who built a model for ship routes, was another contributor to the field.
6. Tjalling C. Koopmans and Kantorovich shared 1975 Nobel Prize in economics for their studies on the optimal allocation of resources.

Which of the statements above about the historical development of operations research are correct?

An investor has $1,000 to invest in bonds and stocks of a company. A bond costs $5 and pays $1 coupon annually. The expected one-year yield on this bond is 25%. A stock costs $10 per share and pays $0.8 dividend. The total rate of return expectation for stock B is 50%. For liquidity reasons, investor demands at least $80 of cash from dividends (or coupons) at the end of the year. So as to manage the risk of the portfolio, investor sets an upper and lower limit to the percentage of the funds to be invested in stocks, which are 40% and 20%, respectively. The investor has to decide the optimal amount of shares which makes the total rate of return for the portfolio is maximum. 

According to the information above, what are the decision variables?

1. x₁ , x₂ , x₃ ≥ 0
2. 8x₂ – x₁ ≥ 0
3. x₁, x₂, ≥ 0
4. e_i , x_i ≥ 0 for all i = 1,...,4
5. x_i,j ≥ 0 (i=1,2,3)   (j=1,2,3,4)

Which of the above can be non-negativity constraints in a linear model?

Which of the following is the last step of an operations research application?

Which of the following is a feasible solution that reaches the most favorable value of the objective function?

1. In the maximization models, the objective function is alternatively named profit function.
2. In the maximization models the value of Z needs to be increased as much as possible.
3. A finite number of iso-profit lines can be drawn for increasing values of Z.
4. Under the constraints of the model, the highest possible value of Z must reside in the feasible region.

Which of the statements above about the maximization models are correct?

1. In the minimization models, the objective function is alternatively named profit function.
2. The ultimate goal of minimizing something is to reduce loss or “cost”.
3. In the minimization models, a line is drawn parallel to the objective function and near to the origin.
4. This line should contain at least one point of the feasible region.
5. The coordinates of this point are found by solving the equations of the drawn line and the boundary line(s) of the feasible region.

Which of the statements above about the minimization models are correct?

1. Urban Planning
2. Currency Arbitrage
3. Inventory Control
4. Agricultural Planning
5. Logistics

In which of the areas above operations research applications, particularly linear programming, are now used as a standard method for decision making?

Which assumption of linear modeling means that each parameter of a linear programming model is constant in all conditions?

When the steps of operations research are taken into consideration, which is the step to be followed after model construction?

Which of the following is a linear expression?