Concept explainers
Explanation of Solution
Solution:
Let,
The size mix and cost of the valves given in the tale below,
Supplier |
Cost Per value (S) |
Percent Large |
Percent Medium | Percent Small |
1 | 5 | 40 | 40 | 20 |
2 | 4 | 30 | 35 | 35 |
3 | 3 | 20 | 20 | 60 |
Then, the total cost of the valves can be expressed as,
In each month, at least 500 large valves should be purchased. Therefore, the constraint can be written as,
In each month, at least 300 medium valves should be purchased. Therefore, the constraint can be written as,
In each month, at least 300 small valves should be purchased. Therefore, the constraint can be written as,
Want to see the full answer?
Check out a sample textbook solutionChapter 4 Solutions
Operations Research : Applications and Algorithms
- Solve the following exercise using jupyter notebook for Python, to find the objective function, variables, constraint matrix and print the graph with the optimal solution. A farm specializes in the production of a special cattle feed, which is a mixture of corn and soybeans. The nutritional composition of these ingredients and their costs are as follows: - Corn contains 0.09 g of protein and 0.02 g of fiber per gram, with a cost of.$0.30 per gram.- Soybeans contain 0.60 g of protein and 0.06 g of fiber per gram, at a cost of $0.90 per gram.0.90 per gram. The dietary needs of the specialty food require a minimum of 30% protein and a maximum of 5% fiber. The farm wishes to determine the optimum ratios of corn and soybeans to produce a feed with minimal costs while maintaining nutritional constraints and ensuring that a minimum of 800 grams of feed is used daily. Restrictions 1. The total amount of feed should be at least 800 grams per day.2. The feed should contain at least 30% protein…arrow_forwardYou are given some tasks of size xK, yK and zK respectively and there are at most 9 tasks each. Determine the best that you could achieve if you are to fill up a hole of size SK, for the following values of x, y, z and S, by maximizing the space used (up to S), i.e. minimizing the used space, if any. Show how many tasks of size x, how many tasks of size y and how many tasks of size z are used in each of the three cases. (g) Now if we relax the requirement so that there are no upper limits on the number of tasks for each type, determine the maximal space usage and the task mix. (h) If we tighten the requirement so that there are still at most 9 tasks of each size, but we also require that each type of tasks must be used at least once, determine maximal space usage and the task mix. Case 1 2 3 X 22 26 28 y 33 43 65 50 77 74 S 488 556 777 You could complete the following table. Fill in the number of tasks inside the brackets and the corresponding maximal usage. (At most 9 tasks each (g)…arrow_forwardThe following table belongs to the optimal solition nit of a Lineer Programming Problem. Obtain the formulation of the initial problem. XI x2 ke -Jig 38 X₁ Xu O 1 O 19 41 14 23 38 xu O O 1 VI 38 A 38 AL A2 (1-38M) (2-19M) 38 19 -3 38 5 L 응급 31 19 19 solution 7' 2 5arrow_forward
- Graphically find all solutions to the following LP: minz=x12x2s.t.x14x1+x28x1x26x1,x20arrow_forwardProblem 1 Consider the following optimization problem: min f(x, y) = 3x² + y* x,y Solve the problem computationally - once by running gradient descent algorithm, and once by running the Newton descent algorithm. Report all parameters used in the two algorithms and the number of iterations to convergence. You have to use Python.arrow_forwardQuestion 14 of 20: Set the best anas 14 Use Gauss-Jordan elimination to solve the following linear system: -3x+4y=-6 5x-y=10 OA (2.0) 08.2-5 OCHED ⒸD. (22) Mark for revine (Will be highlighted on the review page) s Gutxarrow_forward
- Question 14 of 20: Set the best anas 14 Use Gauss-Jordan elimination to solve the following linear system: -3x+4y=-6 5x-y=10 OA (2.0) 08.2-5 OCHED ⒸD. (22) Mark for revine (Will be highlighted on the review page) s Guinarrow_forward5arrow_forwardGive 2 examples of the optimization problem and identify the following for each problem: Objective Function Design Variable Constraintarrow_forward
- Q6: Find the total cost of transportation for the following problem using the method of transportation is less cost. Quantity 2000 Quantity From To 2000 B 500 350 700 850 Cost Int. E F G A 2 5 B 4 9 4 On76arrow_forwardThe initial tableau of a linear programming problem is given. Use the simplex method to solve the problem. X2 X3 6 2 1 2 - 1 - 3 X1 1 3 -5 S₁ 1 0 0 S2 0 1 0 Z 0 0 1 18 39 The maximum is | when x₁ = ₁X₂ = ₁ x3 =₁ $₁=₁ and $₂ = - X3 (Type integers or simplified fractions.)arrow_forwardPlease use Python (without built-in function) to solve this and provide unique solution.arrow_forward
- Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks Cole