20. A maximizing linear programming problem has two constraints: 2X + 4Y ≤ 100 and 3X + 10Y ≤ 210, in addition to constraints stating that both X and Y must be nonnegative. What are the corner points of the feasible region of this problem? Part 2 A. (20, 15) B. (0, 0), (0, 25), (50, 0), (0, 21), and (70, 0) C. (0, 0), (50, 0), (0, 21), and (20, 15) D. (0, 0), (70, 0), (25, 0), and (15, 20) E. (0, 0), (0, 100), and (210, 0)

20. A maximizing linear programming problem has two constraints: 2X + 4Y ≤ 100 and 3X + 10Y ≤ 210, in addition to constraints stating that both X and Y must be nonnegative. What are the corner points of the feasible region of this problem? Part 2 A. (20, 15) B. (0, 0), (0, 25), (50, 0), (0, 21), and (70, 0) C. (0, 0), (50, 0), (0, 21), and (20, 15) D. (0, 0), (70, 0), (25, 0), and (15, 20) E. (0, 0), (0, 100), and (210, 0)

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter7: Nonlinear Optimization Models

Section: Chapter Questions

Problem 59P

See similar textbooks

Part 2

(20, 15)

(0, 0), (0, 25), (50, 0), (0, 21), and (70, 0)

(0, 0), (50, 0), (0, 21), and (20, 15)

(0, 0), (70, 0), (25, 0), and (15, 20)

(0, 0), (0, 100), and (210, 0)

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1 - Introduction

VIEW

Step 2 - Feasible region

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, operations-management and related others by exploring similar questions and additional content below.

Similar questions

21. A linear programming problem has two constraints 2X + 4Y ≤ 100 and 1X + 8Y ≤ 100, plus nonnegativity constraints on X and Y. Which of the following statements about its feasible region is TRUE? Part 2 A. The graphical origin (0, 0) is not in the feasible region. B. The feasible region includes all points that satisfy one constraint, the other, or both. C. The feasible region cannot be determined without knowing whether the problem is to be minimized or maximized. D. The two corner points are (0, 0) and (50, 12.5). E. There are four corner points including (50, 0) and (0, 12.5)
22. Suppose that the feasible region of a maximization LP problem has corners of (0,0), (10,0), (5,5), and (0,7). If profit is given to be $X + $3Y what is the maximum profit the company can earn? Part 2 A. $10 B. $0 C. $14 D. $21 E. $15
11. The shadow price is calculated to be 5 for a less than or equal to constraint in a maximization LP problem, this means: a. if the coefficient of the objective function is increase by 1 then the RHS for that constraint must be increased by 5 b. if the RHS for that constraint is increased by one then the optimal objective function value is increase by 5 c. if the RHS for that constraint is increased by 5 then the optimal objective function value is increase by 1 d. if the coefficient of the objective function is increase by 5 then the RHS for that constraint must be increased by 1 12. Sensitivity Analysis generally assumes a. we are considering a change in two input data values at a time b. are considering a change in only one input data value at a time c. we are considering several change in several input data…
2. Provident Capital Corp. specializes in investment portfolios designed to meet the specific risk tolerances of its clients. A client contacted Provident with P2,000,000 available to invest. Provident’s investment advisor recommends a portfolio consisting of two investment funds: the Dynamic fund and the Diversified fund. The Dynamic fund has a projected annual return of 10%, and the Diversified fund has a projected annual return of 8%. The investment advisor requires that at most P1,400,000 of the client’s funds should be invested in the Dynamic fund. Provident’s services include a risk rating for each investment alternative. The Dynamic fund, which is the more risky of the two investment alternatives, has a risk rating of 6 per P40,000 invested. The Diversified fund has a risk rating of 4 per P40,000 invested. For example, if P400,000 is invested in each of the two investment funds, Provident’s risk rating for the portfolio would be 6(10) + 4(10) = 100. Finally, Provident developed…
Which of the following could not be a constraint for a linear programming problem? Multiple Choice 1A + 2B = 3 1A + 2B 1A + 2B ≤ 3 1A + 2B ≥ 3 1A + 2B + 3C ≤ 3
1. Compare the LP relaxations of the three integer optimization problems: (Problem 1) max 14*x1 + 8*x2 + 6*x3 + 6*x4s.t. 28*x1 + 15*x2 + 13*x3 + 12*x4 <= 39x1, x2, x3, x4 \in {0,1} (Problem 2) max 14*x1 + 8*x2 + 6*x3 + 6*x4s.t. 2*x1 + x2 + x3 + x4 <= 2x1, x2, x3, x4 \in {0,1} (Problem 3) max 14*x1 + 8*x2 + 6*x3 + 6*x4s.t. x2 + x3 + x4 <= 2x1 + x2 <= 1x1 + x3 <= 1x1 + x4 <= 1x1, x2, x3, x4 \in {0,1} Among these three problems, the LP relaxation of which problem can offer a solution whose objective value is closer to the optimal value of the corresponding integer optimization? Problem 2 Problem 3 Problem 1
4 VanMetals has $3500 available for the production of new products. Wall Inc. will buy all the products they can produce.After an initial screening, VanMetals reduced the production alternatives to tables and chairs. Each table can be produced with a cost of $400. Each chair can be produced for $350.VanMetals can devote up to 100 hours to these new products; each table is expected to require 16 hours, and each chair is expected to require 8 hours. The selling prices are $600 per table and $400 per chair.VanMetals’s owner would like to use all-integer linear programming without relaxation to determine the number of tables and the number of chairs to produce to maximize revenue. What are the decision variables? What is the objective function for revenue? What are the constraints? What is the number of tables and the number of chairs to be produced to maximize revenue? What is the Maximum revenue they can expect? Draw the graphical solution of the all-integer problem. take a…
Find solution using BigM (penalty) method.Maximize Z = x1 + 2x2 + 3x3 - x4subject to the constraintsx1 + 2x2 + 3x3 = 152x1 + x2 + 5x3 = 20x1 + 2x2 + x3 + x4 = 10and x1, x2, x3, x4 ≥ 0
3. A company produces three products: A,B and C. Each product requires two raw materials; steel and aluminum. The following LP model describes the company’s product mix problem x1, x2, and x3 represent the number of units of product A, B and C respectivelyMax Z = 30x1 + 10x2 + 50x3Subject to6 x1+ 3 x2 + 5 x3 ≤ 450 (steel)3 x1 + 4 x2+ 5 x3 ≤ 300 (alumimium), X1, x2, x3 ≥ 0 Identify the two production methods that optimize the company’s profit (hint: Use simplex method)
7. A linear programming problem is given as below. What is the optimal solution (X1, X2)? Maximize: Z = 5X1 + 3X2 subject to: X1+ X2≤ 12X1+2X2 ≤ 20X2 ≥ 3X1, X2 ≥ 0 Select one: a. (9, 3) b. (20, 0) c. (0, 12) d. (0, 10) e. (4, 8) f. (2, 10) 7.
1. A specific assignment of values to decision variables is called what? a. Constraint b. Feasible c. Solution d. None of the above 2. Which of the following must be true of a feasible solution a. All of what Solver calls changing variables must be greater than 0 b. It is optimal c. It violates no constraints d. None of the above
Suppose an assignment problem, where there are 3 employees who must perform 3 different tasks. The times (in hours) that employees take to perform each of the tasks is shown below. Each employee must perform only one task, and a task can only be performed by one employee. All employees are paid exactly the same wage per hour of work. Minimize the total time to make all tasks. Task 1 Task 2 Task 3 Employee 1 154 29 40 Employee 2 18 137 12 Employee 3 94 13 31 How many variables does the problem have? How many constraints does the problem have? The objective function corresponds to: