# operations

Topics: Optimization, Linear programming, Constraint Pages: 4 (483 words) Published: September 24, 2014
2 points each
1- The feasible solution space only contains points that satisfy all constraints. 2- Graphical solution to linear programming problems can handle problems that involve any number of decision variables.

3- The value of an objective function decreases as its iso-objective line is moved away from the origin.
4- If a single optimal solution exists to a graphical LP problem, it will exist at a corner point.
5- Using the enumeration approach, optimality is obtained by evaluating every coordinate (or point) in the feasible solution space.
6- A non-unique solution to a linear program indicates the existence of more than one optimal point with different values of the decision variables but the same value of the objective function.
7- An unbounded solution to a linear programing problem is usually due to omitting a constraint.
8- If a linear programming model has no feasible solution space, then the answer to that model is a unique optimal solution.
9- The constraint x1 >= 2 x2 is non linear.
10- In the general diet problem, the objective function is a maximization of profit obtained from selling the foods.

Question
1
T
2
F
3
F
4
T
5
F
6
T
7
T
8
F
9
F
10
F

Problem statement
A group of scouts is spending a few days in a remote hostel where the only foods available are the ones listed in the table below. After consulting with a nutritionist, the group leader learned that a satisfactory diet has at least 2000 kcal of energy, 55g of protein, and 800 mg of calcium. The nutritionist also recommended supplementing with pills of vitamin and iron, which are available for free in the hostel. Since some of the scouts would be happy to subsist on 10 servings of beef and beans, the leader has decided to impose variety by having a limit on the number of servings/day for each of the six foods.

The leader of the group wants to minimize the cost of feeding his group while satisfying minimum nutrition...