Consider the following LP problem: Min 6X+ 27Y Subject to : 2 X + 9Y => 25, and X + Y <= 75. Pick a suitable statement for this problem: a. X=37.5, Y=37.5 is the only optimal solution. b. Optimal Obj. function value is 75 c. X = 0, Y = 0 is the only optimal solution. d. Optimal Obj. function value is 0

Consider the following LP problem: Min 6X+ 27Y Subject to : 2 X + 9Y => 25, and X + Y <= 75. Pick a suitable statement for this problem: a. X=37.5, Y=37.5 is the only optimal solution. b. Optimal Obj. function value is 75 c. X = 0, Y = 0 is the only optimal solution. d. Optimal Obj. function value is 0

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter7: Nonlinear Optimization Models

Section: Chapter Questions

Problem 63P

See similar textbooks

Similar questions

If a monopolist produces q units, she can charge 400 4q dollars per unit. The variable cost is 60 per unit. a. How can the monopolist maximize her profit? b. If the monopolist must pay a sales tax of 5% of the selling price per unit, will she increase or decrease production (relative to the situation with no sales tax)? c. Continuing part b, use SolverTable to see how a change in the sales tax affects the optimal solution. Let the sales tax vary from 0% to 8% in increments of 0.5%.
Find the minimum value of the function z=2x+2y subject to the following constraints. x≤17 y≤16 5x+2y≥42 3x+11y≥84
Consider the following linear programming model: maximize Z = 3x1 + 2x2 subject to : x1 +x2 ≤ 1 x1 + x2 ≥ 2 x1,x2 ≥ 0 a) Write this model in a standard (augmented) form. (i.e. Introduce slack/surplus, artificial etc.)b) Constract the initial simplex tableau and carry on your calculations to solve this model using the simplex method. Interpret your result.
Use the simplex method to maximize the given function. Assume all variables are nonnegative. Maximize f = 7x + 14y + 4z subject to the following. 3x + 5y + 4z ≤ 30 3x + 2y ≤ 4 x + 2y ≤ 8 (x,y,z)= f=
Consider the following LP problem: Min 6X+ 18Y; Subject to : 3 X + 9Y <= 47, and X + Y <= 141. Which one of the following is true?: a. Slack for each constraint is zero. b. Optimal Obj. function value is 94 c. X=70.5, Y=70.5 is the only optimal solution. d. Optimal Obj. function value is 0
A decision problem has the following three constraints: 70X + 6Y <= 420; 24X + 3Y= 72; and 11X - Y <= 14 . The objective function is Min 17X + 38Y . The objective function value is : a. 338 b. 676 c. unbounded d. infeasible e. 0
9. Which of the following is NOT a requirement of a linear programming problem? Select one: a. constraints, expressed as linear equations or inequalities b. an objective function to be maximized or minimized c. an objective function, expressed in linear terms d. alternative courses of action e. one constraint for each decision variable
L.P. Model: Maximize Z= 8X+2Y Subject to: 1X+2Y≤6 (C1) 5X+1Y≤20 (C2) X,Y≥0 On the graph on right, the constraints C1 and C2 have been plotted. Using the point drawing tool, plot the four corner points for the feasible area. The optimum solution is: X = (round your response to two decimal places). Y = (round your response to two decimal places). Optimal solution value Z = (round your response to two decimal places).
Don't use chatgpt, I will 5 upvotes Alan wants to bake blueberry muffins and bran muffins for the school bake sale. For a tray of blueberry muffins, Alan uses 1/3 cup of oil and 2 eggs. For a tray of bran muffins, Alan uses 1/2 cup of oil and 1 egg. Alan has 4 cups of oil and 12 eggs on hand. He sells trays of blueberry muffins for $12 each and trays of bran muffins for $9 each. Alan wants to maximize the money raised at the bake sale. Let x represent the number of blueberry muffins and y represent the number of bran muffins Alan bakes.
Simplex Method Solve the following LP problem using the simplex method. Maximize: P = 9x + 7ySubject to:2x + y ≤ 40 x + 3y ≤ 30x, y ≥ 0 What is the entering variable and leaving variable in Table 1? Choices: A. Entering Variable: y and Leaving Variable: S1 B. Entering Variable: x and Leaving Variable: S1 C. Entering Variable: x and Leaving Variable: S2 D. Entering Variable: y and Leaving Variable: S2
(b) A company produces 3 products A, B and C processed on 3 machines P, Q, R before completion. Machine P can process 25 units of A or 50 unit of B or 75 units of C per hour. Machine Q can process 50 units of any of the products per hour. Machine R can process 50 units of A or 25 unit of B or 100 units of C per hour. The processing hours available on machines P, Q and R are 12, 12 and 13 respectively. Use matrix method, find (i) How many units of each of the three products can be produced per day (ii) The production cost per unit, if cost per hour of operating machines A,B and C are N$500, N$1,000 and N$1,500 respectively. (iii) The total cost of production.
Show the complete Linear Programming Model. Show solutions (i.e. decision variables, objective function, subject to constraints, etc.) Q. A gold processor has two sources of gold ore, source A and source B. In order to keep his plant running, at least three tons of ore must be processed each day. Ore from source A costs $1,000 per ton to process, and ore from source B costs $500 per ton to process. Costs must be kept to less than $4,000 per day. Moreover, Government Regulations require that the amount of ore from source B cannot exceed twice the amount of ore from source A. If ore from source A yields 2 oz. of gold per ton, and ore from source B yields 3 oz. of gold per ton, how many tons of ore from both sources must be processed each day to maximize the amount of gold extracted subject to the above constraints? Formulate the LP model.