1. The standard form of the following linear programming model is given. Find thevalues of variables at the point of intersection of constraint 1 and constraint 3. (Round your answers to 3 decimal places.)(ii)Min Z = 2x, +2x, + Os, + Os, + Os;Subject to:6x – 2x, - 5, = 3-2x, + 3x, - 5, = 6X+x, +s; = 6X,2, 5,52, 5, 20a. What is the value of x?X1b. What is the value of x?X2c. What is the value of s?Sd. What is the value of s?S2e. What is the value of s3?S3f. What is the value of the objective function?Minimum value

Answered: Image /qna-images/answer/04cd2e6b-55aa-4ed5-bb91-d6686d479d41.jpg

Answered: The standard form of the following…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter8: Evolutionary Solver: An Alternative Optimization Procedure

Section8.3: Introduction To Evolutionary Solver

Problem 2P

See similar textbooks

Similar questions

Facility Location. A paper products manufacturer has enough capital to build and manage some additional manufacturing plants in the United States in order to meet increased demand in three cities: New York City, NY; Los Angeles, CA; and Topeka, KS. The company is considering building in Denver, CO; Seattle, WA; and St. Louis, MO. Max Operating Capacity 400 tons/day 700 tons/day Denver Seattle $10/ton $17/tor $5/ton $11/ton.... $18/ton.... $28/ton Los Angeles Topeka New York City Figure 1: Graphical representation of the given data = • The cost fi of building plants in these cities is fi $10,000,000 in Seattle. Unmet Demand 300 tons/day 100 tons/day 500 tons/day • Due to geographic constraints, plants in Denver and Seattle would have a maximum operating capacity kį of 400 tons/day and 700 tons/day respectively. $5,000,000 in Denver and f2 = • The cost cij per ton of transporting paper from city i to city j is outlined in Figure 1. • The unmet demand d, for Los Angeles, Topeka, and New…
For the remaining questions, consider the following problem description: An oil company is considering exploring new well sites S₁, S2, ..., S10 with respective costs C1, C2, C10. And in particular they want to find the least-cost selection of 5 out of the 10 possible sites. The binary decision variables x₁,x2,..., X10 denote the decision to explore the corresponding site.
A college student works in both the school cafeteria and library. She works no more than 12 hours per week at the cafeteria, and no more than 16 hours per week at the library. She must work at least 20 hours each week. Write a system of inequalities that describes all the given conditions. Write a system of inequalities letting x= number of hours worked at the cafeteria per week and y = number of hours worked at the library per week. x+yz x≤ ys
You are to set up a linear program
Show that any 2 *2 matrix A that does not have aninverse will have det A= 0.
Solve the following Linear Programming model using the graphical method (USING EXCEL){Write the steps of construction} Q1)MaximizeH = x + 3y Objective functionsubject tox + y ≤ 502x + y ≤ 60 x ≥ 0, y ≥ 0
Solve this theoretically not on excel please .: A refiner in city Q serves four customers near city W and maintains consignment inventory (owned by the refiner) at each location. Currently, the refiner uses TL (truckload) transportation to deliver separately to each customer. Each truck costs $(740) plus $(309) per stop. The refiner is considering aggregating deliveries to city W on a single truck. The demand of the first customer is 75 tons a year, the demand of the second customer is 30 tons per year, and the demand of the third and fourth customers is 10 tons per year. The product cost is $8,000 per ton, and it uses a holding cost of (24)%. The truck capacity is 20 tons. a. What is the optimal delivery policy to each customer if the refiner ships separately to each of them? What is the annual total inventory-related cost? b. What is the optimal delivery policy to each customer if the refiner aggregates shipments to each of the four customers on every truck that goes to city W? What…
. Consider the following linear programming problem: Maximize 12X + 10Y Subject to: 4X + 3Y = 480 2X + 3Y 360 all variables 20 Which of the following points (X,Y) is not feasible? a (70,70) b. (20,90) c. (100,10) d. (0,100) كلا أجرب الأرقام بالـؤال
Suppose X1 and X2 are defined as: X1 =number of tables to produce, X2 =number of chairs to produce. Answer the following questions: (a) Write an expression representing total number of tables and chairs to be produced in terms of X1 and X2. (b) Suppose a table generates $28 of profit, and a chair generates $24 of profit. What is the expression representing the total profit of X1 tables and X2 chairs? (c) Suppose a table takes 3.3 hours of carpentry and 2.7 hours of painting. What is the expression representing total number of painting hours to be used for producing X1 tables? (d) Suppose a table takes 3 hours of carpentry, a chair takes 2 hours of carpentry, and there are 400 hours of carpentry available. Use a constraint to represent “The total carpentry hours to be used should be no more than the available carpentry hours.” (e) Use a constraint to represent “At least 34 chairs must be produced”; (f) Use a constraint to represent “No more than 380 chairs will be produced.” (g) Use a…
b) The Scott Tractor Company ships tractor parts from Omaha to St. Louis by railroad. However, a contract limits the number of railroad cars the company can secure on each branch/arc during a week. Given these limiting conditions, the company wants to know the maximum number of railroad cars containing tractor parts that can be shipped from Omaha to St. Louis during a week. Phoenix Des Moines 3 5 6. 6. 1. Dallas 2 Omaha St. Louis 7. 3 Denver 6. ActivateW O 31°C
Solve the linear programming problem by the method of corners. Maximize P= x + 6y subject to x + y s4 2x + y s6 x 2 0, y 20 The maximum is P = at (x, y) = Need Help? Read It
FIND THE OPTIMUM SOLUTION TO X= Y= MAX Z=

SEE MORE QUESTIONS

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

SEE MORE TEXTBOOKS