A linear programming model consists of decision variables, constraints, but no objective function.
The terms in the objective function or constraints are not additive.
A constraint is a linear relationship representing a restriction on decision making.
The production manager for the Coory soft drink company is considering the production of 2 kinds of soft drinks: regular and diet. Two of the limited resources are production time (8 hours = 480 minutes per day) and syrup limited to 675 gallons per day. To produce a regular case requires 2 minutes and 5 gallons of syrup, while a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case. What is the time constraint?
2R + 5D LTOREQ 480
2D + 4R LTOREQ 480
2R + 3D LTOREQ 480
3R + 2D LTOREQ 480
2R + 4D LTOREQ 480
Which of the following could not be a linear programming problem constraint?
1A + 2B
1A + 2B = 3
1A + 2B LTOREQ 3
1A + 2B GTOREQ 3
The objective function is a linear relationship reflecting the objective of an operation.
A graphical solution is limited to linear programming problems with
1 decision variable
2 decision variables
3 decision variables
4 decision variables
Linear programming is a model consisting of linear relationships representing a firm's decisions given an objective and resource constraints.
measure the objective function
measure how much or how many items to produce, purchase, hire, etc.
always exist for each constraint
measure the values of each constraint
Non-negativity constraints restrict the decision variables to negative values.
In a linear programming model, the numberof constraints must be less than the number of decision variables.
The region which satisfies all of the constraints in a graphical linear programming problem is called the
region of optimality
feasible solution space
region of non-negativity
optimal solution space
restrict the decision variables to zero.
restrict the decision variables to positive values
restrict the decision variables to negative values
do not restrict the sign of the decision variable.
both a and b
Cully furniture buys 2 products for resale: big shelves (B) and medium shelves (M). Each big shelf costs $500 and requires 100 cubic feet of storage space, and each medium shelf costs $300 and requires 90 cubic feet of storage space. The company has $75000 to invest in shelves this week, and the warehouse has 18000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150. What is the objective function?
Z = $300B + $100M
Z = $300M + $150B
Z = $300B + $150M
Z = $300B + $500M
Z = $500B + $300M
Proportionality means the slope of a constraint or objective function line is not constant.
In a linear programming problem, a valid objective function can be represented as
Max Z = 5xy
Max Z 5x2 + 2y2
Max 3x + 3y + 1/3z
Min (x1 + x2) / x3
Which of the following could be a linear programming objective function?
Z = 1A + 2BC + 3D
Z = 1A + 2B + 3C + 4D
Z = 1A + 2B / C + 3D
Z = 1A + 2B2 + 3D
all of the above
Decision models are mathematical symbols representing levels of activity.
A feasible solution violates at least one of the constraints.
The _______________ property of linear programming models indicates that the decision variables cannot be restricted to integer values and can take on any fractional value.
Excerpt from file: Math Tutorial Answer appear in BLUE A linear programming model consists of decision variables, constraints, but no objective function. True False The terms in the objective function or constraints are not additive. True False A constraint is a linear relationship representing a restriction on
Print Length: 5 Pages/Slides
Surround your text in
**bold**, to write a math equation use, for example,