[go: up one dir, main page]
Scribd
Upload
20 views6 pages

Dorian Auto - Solución Chatgpt

Uploaded by

PanzonMetalero
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
20 views6 pages

Dorian Auto - Solución Chatgpt

Uploaded by

PanzonMetalero
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Variables:

 Let xxx be the number of 1-minute comedy commercials purchased.


 Let yyy be the number of 1-minute football commercials purchased.

Objective Function:

We want to minimize the total cost of the commercials. The cost function can be
represented as:

Minimize C=50000x+100000y\text{Minimize } C = 50000x +


100000yMinimize C=50000x+100000y

Constraints:

1. High-Income Women Reach: Each comedy commercial reaches 7 million high-


income women, and each football commercial reaches 2 million. The total reach for
women must be at least 28 million:

7x+2y≥287x + 2y \geq 287x+2y≥28

2. High-Income Men Reach: Each comedy commercial reaches 2 million high-


income men, and each football commercial reaches 12 million. The total reach for
men must be at least 24 million:

2x+12y≥242x + 12y \geq 242x+12y≥24

3. Non-negativity Constraints: The number of commercials cannot be negative:

x≥0x \geq 0x≥0 y≥0y \geq 0y≥0

Summary of the Model:

 Objective: Minimize C=50000x+100000yC = 50000x +


100000yC=50000x+100000y
 Subject to: 7x+2y≥287x + 2y \geq 287x+2y≥28 2x+12y≥242x + 12y \geq
242x+12y≥24 x≥0x \geq 0x≥0 y≥0y \geq 0y≥0

Solving the Problem:

To find the optimal solution, you can use the graphical method or simplex method. Below
are the steps for the graphical approach:

1. Graph the Constraints:


o Rearranging the first constraint: y≥28−7x2y \geq \frac{28 - 7x}
{2}y≥228−7x
o Rearranging the second constraint: y≥24−2x12y \geq \frac{24 - 2x}
{12}y≥1224−2x
2. Plot these lines on a graph and determine the feasible region, which is the area
where all constraints overlap.
3. Identify the Corner Points: Calculate the intersection points of the lines to find the
corner points of the feasible region.
4. Evaluate the Objective Function: Calculate the cost CCC at each corner point to
find the minimum.

Finding the Intersections:

1. Set the two constraints equal to each other:

7x+2y=28(1)7x + 2y = 28 \quad \text{(1)}7x+2y=28(1) 2x+12y=24(2)2x + 12y =


24 \quad \text{(2)}2x+12y=24(2)

2. Solve this system of equations to find the intersection points.

Example Calculations:

1. From equation (1):

y=28−7x2y = \frac{28 - 7x}{2}y=228−7x

2. Substitute yyy in equation (2):

2x+12(28−7x2)=242x + 12\left(\frac{28 - 7x}{2}\right) = 242x+12(228−7x)=24

This simplifies to find xxx and subsequently yyy.

Once you find the corner points and evaluate the objective function, you will arrive at the
optimal values of xxx and yyy that minimize the cost while meeting the advertising
requirements.

If you’d like assistance in calculating specific values or if you want to use a solver tool, let
me know!

To solve the Reddy Mikks Company problem using linear programming, we will define the
variables, objective function, and constraints based on the information provided.

Variables:
 Let xxx be the number of tons of exterior paint produced.
 Let yyy be the number of tons of interior paint produced.

Objective Function:

We want to maximize the gross income from selling the paints. The objective function can
be represented as:

Maximize Z=3000x+2000y\text{Maximize } Z = 3000x +


2000yMaximize Z=3000x+2000y

Constraints:

1. Raw Material A Constraint: Each ton of exterior paint requires 1 ton of raw
material A, and each ton of interior paint requires 2 tons. The total availability of
raw material A is 6 tons:

x+2y≤6x + 2y \leq 6x+2y≤6

2. Raw Material B Constraint: Each ton of exterior paint requires 2 tons of raw
material B, and each ton of interior paint requires 1 ton. The total availability of raw
material B is 8 tons:

2x+y≤82x + y \leq 82x+y≤8

3. Interior vs. Exterior Paint Demand: The daily demand for interior paint cannot
exceed that of exterior paint by more than 1 ton:

y≤x+1y \leq x + 1y≤x+1

4. Maximum Demand for Interior Paint: The maximum demand for interior paint is
limited to 2 tons:

y≤2y \leq 2y≤2

5. Non-negativity Constraints: The production amounts cannot be negative:

x≥0x \geq 0x≥0 y≥0y \geq 0y≥0

Summary of the Model:

 Objective: Maximize Z=3000x+2000yZ = 3000x + 2000yZ=3000x+2000y


 Subject to: x+2y≤6x + 2y \leq 6x+2y≤6 2x+y≤82x + y \leq 82x+y≤8 y≤x+1y \leq x
+ 1y≤x+1 y≤2y \leq 2y≤2 x≥0x \geq 0x≥0 y≥0y \geq 0y≥0

Solving the Problem:


To find the optimal solution, we can use the graphical method or a simplex method. Here,
I'll outline the graphical approach:

1. Graph the Constraints: Rearranging the constraints to express yyy in terms of


xxx:
o From x+2y≤6x + 2y \leq 6x+2y≤6:

y≤6−x2y \leq \frac{6 - x}{2}y≤26−x

o From 2x+y≤82x + y \leq 82x+y≤8:

y≤8−2xy \leq 8 - 2xy≤8−2x

o From y≤x+1y \leq x + 1y≤x+1 (already in the desired form).


o From y≤2y \leq 2y≤2 (already in the desired form).
2. Plot the Lines: Draw the lines for each of the rearranged inequalities on a graph.
3. Identify the Feasible Region: The feasible region is the area where all constraints
overlap.
4. Find the Corner Points: Calculate the intersection points of the constraint lines,
which represent the corner points of the feasible region.

Finding the Intersection Points:

1. Intersection of x+2y=6x + 2y = 6x+2y=6 and 2x+y=82x + y = 82x+y=8:

y=6−x2y = \frac{6 - x}{2}y=26−x

Substitute into the second equation:

2x+6−x2=82x + \frac{6 - x}{2} = 82x+26−x=8

Multiply by 2 to eliminate the fraction:

4x+6−x=16 ⟹ 3x=10 ⟹ x=103≈3.334x + 6 - x = 16 \implies 3x = 10 \implies x


= \frac{10}{3} \approx 3.334x+6−x=16⟹3x=10⟹x=310≈3.33

Substitute back to find yyy:

y=6−1032=18−1032=8/32=43≈1.33y = \frac{6 - \frac{10}{3}}{2} = \frac{\frac{18


- 10}{3}}{2} = \frac{8/3}{2} = \frac{4}{3} \approx 1.33y=26−310=2318−10=28/3
=34≈1.33

2. Calculate Other Intersections:


o For x+2y=6x + 2y = 6x+2y=6 and y=2y = 2y=2:
x+2(2)=6 ⟹ x+4=6 ⟹ x=2x + 2(2) = 6 \implies x + 4 = 6 \implies x =
2x+2(2)=6⟹x+4=6⟹x=2

Point: (2,2)(2, 2)(2,2)

o For 2x+y=82x + y = 82x+y=8 and y=2y = 2y=2:

2x+2=8 ⟹ 2x=6 ⟹ x=32x + 2 = 8 \implies 2x = 6 \implies x =


32x+2=8⟹2x=6⟹x=3

Point: (3,2)(3, 2)(3,2)

o For 2x+y=82x + y = 82x+y=8 and y=x+1y = x + 1y=x+1: Substitute yyy:

2x+(x+1)=8 ⟹ 3x+1=8 ⟹ 3x=7 ⟹ x=73, y=103 (not feasible, since y>


2)2x + (x + 1) = 8 \implies 3x + 1 = 8 \implies 3x = 7 \implies x = \frac{7}
{3}, \, y = \frac{10}{3} \text{ (not feasible, since } y > 2\text{)}2x+
(x+1)=8⟹3x+1=8⟹3x=7⟹x=37,y=310 (not feasible, since y>2)

Corner Points:

1. (0,0)(0, 0)(0,0)
2. (2,2)(2, 2)(2,2)
3. (3,2)(3, 2)(3,2)
4. (103,43)\left( \frac{10}{3}, \frac{4}{3} \right)(310,34)

Evaluate the Objective Function at Each Corner Point:

 For (0,0)(0, 0)(0,0): Z=3000(0)+2000(0)=0Z = 3000(0) + 2000(0) =


0Z=3000(0)+2000(0)=0
 For (2,2)(2, 2)(2,2): Z=3000(2)+2000(2)=6000+4000=10000Z = 3000(2) + 2000(2)
= 6000 + 4000 = 10000Z=3000(2)+2000(2)=6000+4000=10000
 For (3,2)(3, 2)(3,2): Z=3000(3)+2000(2)=9000+4000=13000Z = 3000(3) + 2000(2)
= 9000 + 4000 = 13000Z=3000(3)+2000(2)=9000+4000=13000
 For (103,43)\left( \frac{10}{3}, \frac{4}{3} \right)(310,34):
Z=3000(103)+2000(43)=10000+80003≈12666.67Z = 3000\left(\frac{10}{3}\right)
+ 2000\left(\frac{4}{3}\right) = 10000 + \frac{8000}{3} \approx
12666.67Z=3000(310)+2000(34)=10000+38000≈12666.67

Conclusion:

The maximum gross income occurs at the point (3,2)(3, 2)(3,2).

 Optimal Production: Produce 3 tons of exterior paint and 2 tons of interior


paint daily to maximize gross income.
 Maximum Income: $13,000.
If you need further clarification or any additional calculations, let me know!

You might also like