a)Would profit be maximized if the objective function y=50x+40xM+20x, was assumed (under the same contraints) for the same problem? Mr. Omar-doh sells sheep during the annual county auction. He wishes to use linear programming to describe his problem and therefore consults the UoN for assistance. Sheep come in three sizes: large, medium, and small. The large sheep (x.) cost Kshs. 3,500 and sell for Kshs.6,000 each; the medium sheep (x) cost Kshs.3,000 and sell for Kshs.5,000 each; the small sheep (x.) cost Kshs. 1,500 and sell for Kshs.2,500 each. Omar-doh must order at least twenty sheep of each type. He can spend no more than Kshs.0.3 million on sheep investment. His space limitations are such that he cannot exceed 60 units of the large and medium sheep combined. He wants to obtain a gross revenue of at least half a million from selling sheep. He further wants to maximize his profits subject to all the constraints above.

a)Would profit be maximized if the objective function y=50x+40xM+20x, was assumed (under the same contraints) for the same problem? Mr. Omar-doh sells sheep during the annual county auction. He wishes to use linear programming to describe his problem and therefore consults the UoN for assistance. Sheep come in three sizes: large, medium, and small. The large sheep (x.) cost Kshs. 3,500 and sell for Kshs.6,000 each; the medium sheep (x) cost Kshs.3,000 and sell for Kshs.5,000 each; the small sheep (x.) cost Kshs. 1,500 and sell for Kshs.2,500 each. Omar-doh must order at least twenty sheep of each type. He can spend no more than Kshs.0.3 million on sheep investment. His space limitations are such that he cannot exceed 60 units of the large and medium sheep combined. He wants to obtain a gross revenue of at least half a million from selling sheep. He further wants to maximize his profits subject to all the constraints above.

Name: a)Would profit be maximized if the objective function y=50x_+40xm+20x
Uploaded: 2024-03-20T07:07:26.000Z
Channel: Bartleby
Description: a)Would profit be maximized if the objective function y=50x_+40xm+20x, was assumed (under the samecontraints) for the same problem?Mr. Omar-doh sells sheep during the annual county auction. He wishes to use linearprogramming to describe his problem

MATLAB: An Introduction with Applications

6th Edition

ISBN:9781119256830

Author:Amos Gilat

Publisher:Amos Gilat

Chapter1: Starting With Matlab

Section: Chapter Questions

Problem 1P

See similar textbooks

Similar questions

b)Present the standard form of the LPP in the question attached below;
Letter d only
Consider the following integer nonlinear programming problem. Маximize Z = xx3x3, XX2X3 , subject to X1 + 2x2 + 3x3< 10 x121, x 2 1, xz 2 1, and X1, X2, X3 are integers. Use dynamic programming to solve this problem. Please show your steps (show your tables).
An investor has $621,000 to invest in bonds. Bond A yields an average of 8% and the bond B yields 7%. The investor requires that at least 5 times as much money be invested in bond A as in bond B. You must invest in these bonds to maximize his return. This can be set up as a linear programming problem. Introduce the decision variables: x= dollars invested in bond Ay= dollars invested in bond B Compute x+y. $ . Round to the nearest cent. Investor Matt has $152,000 to invest in bonds. Bond A yields an average of 9.2% and the bond B yields 8.4%. Matt requires that at least 4 times as much money be invested in bond A as in bond B. You must invest in these bonds to maximize his return. What is the maximum return? $ per year. Round to the nearest cent. Investor Dan has $607,000 to invest in bonds. Bond A yields an average of 8.5% and the bond B yields 8.4%. Dan requires that at least 4 times as much money be invested in bond A as in…
Is this constraint linear or able to be included as a constraint in a linear programming problem? 4X1 – (1/3)X2 = 75
A firm manufactures 2 products A and B. The profits are 5$ and 8$ respectively. The firm has 2 machines and below is the required processing time in hours for each machine on each product. Product A В Machines G 6. 8. H 4 Machine G must be operated for at least 48 hours. Hours Available for machine H is 20 hours. Set up an LP problem to maximize profit and solve it graphically.
Use the simplex method to solve the linear programming problem. X₂ (Type integers or simplified fractions.) OB. There is no maximum. Maximize subject to: Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. OA. The maximum is when X₁ 1, 8₂, and s₂ -. 5₁ = with z = 10x₁ + 18x₂ 6x₁ + 3x₂ $36 5X4 X5 20 3x₁ + 3x₂ ≤42 x₁20, X₂ 20
I am learning about this for the first time and I did this question but feel like I did not answer the parts correctly. Please could I see how an expert would answer the whole problem to compare. the question is to construct an LP model where all the variables constrained are positive.
A company produces three types of solar panels, types A, B and C at a profit of €50 ,€90 and €150 respectively. If X, is the number of type A generators, X, is the number of type B generators and X3 is the number of type C generators sold by the company then from the data in the simplex table below, determine the value of the maximum profit Z. X, X2 X3 S, S2 S3 X3 1 0.1 0.7 0.4 80 X, 1 0.8 0.4 0.3 60 X2 1 0.2 -0.6 0.8 40 P 5.1 3.9 7.6 Answer:
please help me
Write the transportation problem as a linear programming problem in terms and solvent of x and y and solve. (Indicate the number of units that should be transported from each factory to each depot and the total transportation cost.)
1a and 2a please written out