Answered: Graph the feasible region for the… | bartleby

Practical Management Science

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter4: Linear Programming Models

Section: Chapter Questions

Problem 135P

See similar textbooks

Related questions

Concept explainers

Question

Graph the feasible region for the optimization model and the following constraints:

Optimization model:

Max P=30X +20 Y

Constraints:

2X + Y <= 1000 (decorating hours)

X+Y<= 800 (baking hours)

X <= 400 ( market demand)

X>= 0

Y>=0

Expert Solution

Step by step

Solved in 5 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Blurred answer

Knowledge Booster

Optimization models

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

Solve Problem 1 with the extra assumption that the investments can be grouped naturally as follows: 14, 58, 912, 1316, and 1720. a. Find the optimal investments when at most one investment from each group can be selected. b. Find the optimal investments when at least one investment from each group must be selected. (If the budget isnt large enough to permit this, increase the budget to a larger value.)
This problem is based on Motorolas online method for choosing suppliers. Suppose Motorola solicits bids from five suppliers for eight products. The list price for each product and the quantity of each product that Motorola needs to purchase during the next year are listed in the file P06_93.xlsx. Each supplier has submitted the percentage discount it will offer on each product. These percentages are also listed in the file. For example, supplier 1 offers a 7% discount on product 1 and a 30% discount on product 2. The following considerations also apply: There is an administrative cost of 5000 associated with setting up a suppliers account. For example, if Motorola uses three suppliers, it incurs an administrative cost of 15,000. To ensure reliability, no supplier can supply more than 80% of Motorolas demand for any product. A supplier must supply an integer amount of each product it supplies. Develop a linear integer model to help Motorola minimize the sum of its purchase and administrative costs.
Consider the following linear programming model with 4 regular constraints:Maximize 3X + 5Y (a) Draw your graph in the space below:subject to: 4X + 4Y ≤ 48 (constraint #1) 4X + 3Y ≤ 50 (constraint #2) 2X + 1Y ≤ 20 (constraint #3) X ≥ 2 (constraint #4) X, Y ≥ 0 (non-negativity constraints)(a) Which of the constraints is redundant? Constraint #______.Justify by drawing a graph similar to Figure 7.14 on p.263.(b) Is point (9,3) a feasible solution? _____. Explain your answer (by analyzing each of the constraints).Constraint #1: _______________________________________________________________Constraint #2: _______________________________________________________________Constraint #3: _______________________________________________________________Constraint #4: ______________________________________________________________

Recommended textbooks for you

Practical Management Science

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Practical Management Science

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

SEE MORE TEXTBOOKS