Question
Nonbasic variables are always set to ________. a. 0.1 b. 10 c. 0 d. 1 A linear programming problem has objective function P = 3x
Nonbasic variables are always set to ________.
a. | 0.1 | |
b. | 10 | |
c. | 0 | |
d. | 1 |
A linear programming problem has objective function P = 3x + 2y and the following linear inequality constraints.
x y 0, x + y 3, x 0, y 0
How many slack variables are needed for the simplex algorithm?
a. | 2 | |
b. | 3 | |
c. | 1 | |
d. | 4 |
Graphical optimal valuefor Zcan be obtained from
a. | cornerpointsofthesolutionregion | |
b. | corner points of feasible region | |
c. | bothaand b | |
d. | noneoftheabove |
A resource which is completely utilized is called _____________ in simplex.
a. | scarce resource | |
b. | zero resource | |
c. | null resource | |
d. | abundant resource |
Maximise Z = 3x+ 4ySubject to the constraints:x + y<4, x>0, y>0 Find the maximum value of Z?
a. | 12 | |
b. | 10 | |
c. | 14 | |
d. | 16 |
in graphical representation the bounded region is known as _________ region |
a. | solution | |
b. | basicsolution | |
c. | feasible solution | |
d. | optimal |
The shadow price is calculated to be 3 for a less than or equal to constraint in a maximization LP problem, this means:
a. | if the RHS for that constraint is increased by one then the optimal objective function value is increase by 3 dollars. | |
b. | if the coefficient of the objective function is increase by 3 then the RHS for that constraint must be increased by 1. | |
c. | if the coefficient of the objective function is increase by 1 then the RHS for that constraint must be increased by 3. | |
d. | if the RHS for that constraint is increased by three then the optimal objective function value is increase by 1 dollars. |
A constraint has a slack of 5 units. This implies that:
a. | this constraint is binding | |
b. | This constraint has 5 units of its resources unconsumed | |
c. | this constraint has a surplus of 5 units | |
d. | this constraint has exceeded its minimal requirement by 5 units |
Muir Manufacturing produces two popular grades of commercial carpeting among its many other products. In the coming production period, Muir needs to decide how many rolls of each grade should be produced in order to maximize profit. Each roll of Grade X carpet uses 50 units of synthetic fiber, requires 25 hours of production time, and needs 20 units of foam backing. Each roll of Grade Y carpet uses 40 units of synthetic fiber, requires 28 hours of production time, and needs 15 units of foam backing. The profit per roll of Grade X carpet is $200 and the profit per roll of Grade Y carpet is $160. In the coming production period, Muir has 3000 units of synthetic fiber available for use. Workers have been scheduled to provide at least 1800 hours of production time (overtime is a possibility). The company has 1500 units of foam backing available for use. Develop and solve a linear programming model for this problem.What's the optimal solution forthe company?
a. | a. X = 0, Y = 75, Z = 12000 | |
b. | X = 80, Y = 42, Z = 30000 | |
c. | X = 15, Y =2v5, Z = 10000 | |
d. | X = 20.5, Y = 33, Z = 11000 |
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started