Question

In: Computer Science

4. Given a linear programming optimization problem, with the choice of two products, we know in...

4. Given a linear programming optimization problem, with the choice of two products, we know in advance that a possible answer is to make only one product.

5. Cost minimization problems typically involve constraints which have the phrase “at least”.  

Please explain each answer in your own words

1. Please show what slack resources are graphically. You can draw a picture and scan it or take a picture and add it to the document.

2. Please given an example of a constraint for a cost minimization problem.

3. Give an example of an objective function not listed in the book.

4. Why is it important to have non-negative answers to linear programming problems?

5. What is meant by divisibility in linear programming? Explain in your own words and include an example.  

Note: You can use Excel and just paste the images of the output on to the Word document.

1. You are a hipster who has a workshop, which makes artisan cabinets out of Bocote wood. Specifically, you make chifforobes and pie safes. Each chifforobe you make earns $200 profit and each pie safe earns $150. Each chifforobes requires 150 board feet of bocote wood and 10 hours of labor. Each pie safe requires 100 board-feet of bocote wood and 15 hours of labor. Each month you have 3000 board-feet of bocote wood and 300 hours of labor.

a. How many chifforobes and pie safes should you make each month if you want to maximize your profits?

b. What if one month you run short on bocote wood and only have 1500 board-feet, how many chifforobes and pie safes should you make to maximize profits?

2. You have now tired of making artisan cabinets. You decide to use all the profits you made making cabinets to buy a farm and grow dragon carrots. Your dragon carrot farm requires an organic fertilizer mix that has at least 900 decigrams of nitrogen, 480 decigrams of phosphorus, and 15 decigrams of potassium. You have two choices of organic fertilizer: Blue Zippy and Harmonic Flash. Blue Zippy costs $20 a pound and each pound contains 50 decigrams of nitrogen, 50 decigrams of phosphorus, and 5 decigrams of potassium. Harmonic Flash $30 a pound and each pound contains 100 decigrams of nitrogen, 30 decigrams of phosphorus, and no potassium.

a. How much Blue Zippy and Harmonic Flash should you buy to meet your requirements, while minimizing cost?

b. If Harmonic Flash changed their mix to include 40 decigrams of phosphorus and 1 decigram of potassium, would you change your order? If so, how?

Solutions

Expert Solution


Related Solutions

Given the following linear optimization problem Maximize 10x + 20y Subject to x + y <...
Given the following linear optimization problem Maximize 10x + 20y Subject to x + y < 50 2x + 3y < 120 x > 10 x, y > 0 (a) Graph the constraints and determine the feasible region. (b) Find the coordinates of each corner point of the feasible region. (c) Determine the optimal solution and optimal objective function value.
Solve the given linear programming problem using the simplex method. If no optimal solution exists, indicate...
Solve the given linear programming problem using the simplex method. If no optimal solution exists, indicate whether the feasible region is empty or the objective function is unbounded. (Enter EMPTY if the feasible region is empty and UNBOUNDED if the objective function is unbounded.) Minimize c = x + y + z + w subject to x + y ≥ 80 x + z ≥ 60 x + y − w ≤ 50 y + z − w ≤ 50...
Linear programming. Solve the following two (2) Linear programming problems (#1 and #2) and then answer...
Linear programming. Solve the following two (2) Linear programming problems (#1 and #2) and then answer question 3: 1.. Solve the following LP problem graphically: Maximize profit =            X + 10Y Subject to:                        4X + 3Y < /= 36                                            2X +4Y < / = 40                                            Y > / = 3                                            X, Y > / = 0 2. Considering the following LP problem and answer the questions, Part a and Part b: Maximize profit =            30X1...
Every linear programming problem involves optimizing a: Select one: a. linear function subject to several linear...
Every linear programming problem involves optimizing a: Select one: a. linear function subject to several linear constraints b. linear regression model subject to several linear constraints c. linear function subject to several non-linear constraints d. non-linear function subject to several linear constraints
Consider the following transportation problem. Formulate this problem as a linear programming model and solve it...
Consider the following transportation problem. Formulate this problem as a linear programming model and solve it using the MS Excel Solver tool. Shipment Costs ($), Supply, and Demand: Destinations Sources 1 2 3 Supply A 6 9 100 130 B 12 3 5 70 C 4 8 11 100 Demand 80 110 60 (4 points) Volume Shipped from Source A __________ (4 points) Volume Shipped from Source B __________ (4 points) Volume Shipped from Source C __________ (3 points) Minimum...
1)Write down the optimization problem defining the lasso estimator in the context of a linear model...
1)Write down the optimization problem defining the lasso estimator in the context of a linear model 2) (continued) Do the degrees of freedom of the estimator increase or decrease as a function of tuning the parameter? Explain.
Write the following linear optimization problem in standard form. Maximize 2x + y Subject to        ...
Write the following linear optimization problem in standard form. Maximize 2x + y Subject to         x + y > 2      3x + 4y < 12           x, y > 0
To find the optimal solution to a linear optimization problem, do you have to examine all...
To find the optimal solution to a linear optimization problem, do you have to examine all the points in the feasible region? Explain. Can a linear programming problem have no solution? More than one solution? Explain. ---------------------------------------------------------------------------------------------------------------- A beverage can manufacturer makes three sizes of soft drink cans—Small, Medium and Large. Production is limited by machine availability, with a combined maximum of 90 production hours per day, and the daily supply of metal, no more than 120 kg per day....
The optimal solution of the linear programming problem is at the intersection of constraints 1 and...
The optimal solution of the linear programming problem is at the intersection of constraints 1 and 2. Please answer the following questions by using graphical sensitivity analysis. Max s.t. Max 2x1 + x2 s.t. 4x1 +1x2 ≤8 4x1 +3x2 ≤12 1x1 +2x2 ≤6 x1 , x2 ≥ 0 Over what range can the coefficient of x1 vary before the current solution is no longer optimal? Over what range can the coefficient of x2 vary before the current solution is no...
For the following linear programming problem:    Maximize z = 2x1+ x2    Such that     ...
For the following linear programming problem:    Maximize z = 2x1+ x2    Such that      x1+ 2x2 ≤ 12          x2 ≥ 3       x1,x2 ≥ 0 (a) Write the first two constraints in equation form by adding slack or subtracting excess (surplus) variables. (b)Find all basic solutions for this LP (c) Which of these solutions are feasible? (d)Which of these feasible solutions is optimal? Find the optimal value of z
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT