Answered: Problem 4: Use the big-M method to…

Problem 4: Use the big-M method to solve the following linear program. 2x1 +2x2 +4x3 +4x2 +2x3 <4 +2x2 +x3 min s.t. X1 X1 2x1 +1.5x3 < 3 X1,X2, X3 2 0

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter6: Optimization Models With Integer Variables

Section6.3: Capital Budgeting Models

Problem 3P: Solve Problem 1 with the extra assumption that the investments can be grouped naturally as follows:...

See similar textbooks

Similar questions

Solve Problem 1 with the extra assumption that the investments can be grouped naturally as follows: 14, 58, 912, 1316, and 1720. a. Find the optimal investments when at most one investment from each group can be selected. b. Find the optimal investments when at least one investment from each group must be selected. (If the budget isnt large enough to permit this, increase the budget to a larger value.)
Explain all the steps when implementing the Branch and Bound method for the following optimization problem: Max 15*x1+12*x2+4*x3+2*x4 s.t. 8*x1+5*x2+3*x3+2*x4 <=10 3*x1+2*x3<=4 x1, x2, x3, x4 binary
Given this linear programming model, solve the model and then answer the questions that follow. Maximize Z = 12x1 + 18x2 + 15x3 where x1 = the quantity of product 1 to make, etc. Subject to Machine: 5x 1 + 4x 2 + 3x 3 ≤ 160 minutes Labor: 4x1 + 10x2 + 4x3 ≤ 288 hours Materials: 2x 1 + 2x2 + 4x3 ≤ 200 pounds Product 2: x2 ≤ 16 units x1, x2, x3 ≥ 0 a) Are any constraints binding? If so, which one(s)? b) If the profit on product 3 were changed to $22 a unit, what would the values of the decision variables be? The objective function? Explain. c) If the profit on product 1 were changed to $22 a unit, what would the values of the decision variables be? The objective function? Explain. d) If 10 hours less of labor time were available, what would the values of the decision variables be? The objective function? Explain. e) If the manager decided that as many as 20 units of product 2 could be produced (instead of 16), how much additional profit would be generated? f) If profit per unit on each…
Instruction: Formulate the dual problems for X2 the following linear programming model No need to compute/doing a tableau 1. Maximize Z = 2X1 + X2 Subject to: X2 < 10 2X1 + 5X2 < 60 X1 + X2 <18 3X1 + X2 < 44 2. Maximize Z = 2X1 + X2 +3X3 Subject X1 + X2 + 2X3 < 400 2X1 + X2 + X3 < 500 3. Maximize Z = 80X1 + 60X2 Subject X1 + X2 = 200 X1 < 50 X2 > 80
develope a space matrix for macdonalds. Below are the instructions. The steps required to develop a SPACE Matrix are as follows: 1. Select a set of variables to define financial position (FP), competitive position (CP), stability position (SP), and industry position (IP). 2. Assign a numerical value ranging from +1 (worst) to +7 (best) to each of the variables that make up the FP and IP dimensions. Assign a numerical value ranging from -1 (best) to -7 (worst) to each of the variables that make up the SP and CP dimensions. On the FP and CP axes, make comparison to competitors. On the IP and SP axes, make comparison to other industries. 3. Compute an average score for FP, CP, IP, and SP by summing the values given to the variables of each dimension and then by dividing by the number of variables included in the respective dimension. 4. Plot the average scores for FP, IP, SP, and CP on the appropriate axis in the SPACE Matrix. 5. Add the two scores on the x-axis and plot the resultant…
Company Z is contemplating a product development program encompassing 6 major projects. The company is constrained from embarking on all of the projects at once by the number of available (budgeted) developers (60) and the budget allocated for project expenses (£200,000). The following table shows the resource requirements and the estimated profit for each project. Use EXCEL’s Solver to answer question 1. 1. Suppose that CEO of company Z decides that project 2 and project 5 are mutually exclusive when all other projects remain independent. What is the revised project portfolio and the revised maximum profit?
Suppose Jack like to solve the following formulation in Excel. And the problem is setup in Excel like this: See attached picture. A B C D E 1 X1 X2 2 decision variable objective 3 coefficient of objective function 2 3 4 Constraints LHS RHS 5 Constraints 1 2 1 3 6 Constraints 2 4 5 20 7 Constraints 3 2 8 16 8 Constraints 4 5 6 60 We want to put our objective function in cell D3. What should we type in D3? In cell D5 to D8, we will put the left hand side of our constraint. What should we type in D8? In OpenSolver, what should we assign to Variable Cell? What should you do to input the non-negativity constraint in OpenSolver?
Transeast Airlines flies planes on the following route:L.A.–Houston–N.Y.–Miami–L.A. The length (in miles) ofeach segment of this trip is as follows: L.A.–Houston, 1,500miles; Houston–N.Y., 1,700 miles; N.Y.–Miami, 1,300miles; Miami–L.A., 2,700 miles. At each stop, the planemay purchase up to 10,000 gallons of fuel. The price of fuelat each city is as follows: L.A., 88¢; Houston, 15¢; N.Y.,$1.05; Miami, 95¢. The plane’s fuel tank can hold at most12,000 gallons. To allow for the possibility of circling overa landing site, we require that the ending fuel level for eachleg of the flight be at least 600 gallons. The number ofgallons used per mile on each leg of the flight is1 (average fuel level on leg of flight/2,000)Review Problems 123To simplify matters, assume that the average fuel level onany leg of the flight isFormulate an LP that can be used to minimize the fuel costincurred in completing the schedule
20. A maximizing linear programming problem has two constraints: 2X + 4Y ≤ 100 and 3X + 10Y ≤ 210, in addition to constraints stating that both X and Y must be nonnegative. What are the corner points of the feasible region of this problem? Part 2 A. (20, 15) B. (0, 0), (0, 25), (50, 0), (0, 21), and (70, 0) C. (0, 0), (50, 0), (0, 21), and (20, 15) D. (0, 0), (70, 0), (25, 0), and (15, 20) E. (0, 0), (0, 100), and (210, 0)
The Kandy Company wants to schedule the following seven-job problem to be processed on two machines A and B. Each job must be processed by two machines A and B, first on machine A and then machine B. The operation processing times at machine A and Bare as follows: Job i 1 2 3 4 5 6 7 Processing time on Machine A (ai) 9 8 7 12 6 8 15 Processing time on Machine B (bi) 6 5 7 19 12 11 7 a. Suppose jobs arrived in their natural order (i.e., job l before job 2, etc.), and FIFO systems of scheduling and processing the jobs is used. What is the completion time of each job and what is the total throughput time (makespan) of all jobs? b. Suppose the inter-arrival times between jobs can be treated as zero and Johnson’s rule is used to sequence and process the jobs, what is the time of each job and what is the total throughput time (makespan) of all jobs? c. What would be the difference in the average time a job spends in the shop…
A linear programming problem is given as follows:min ? = −4?1 + ?2Subject to 8?1 + 2?2 ≥ 164?1 + 2?2 ≤ 12?1 ≤ 6?2 ≤ 4?1, ?2 ≥ 0 I) Find the A, B, C, D, E, F, and G points on the plot below II) Identify the feasible solution area graphically on the following plot (by shading thearea) III) Which points are the extreme points IV) What is the solution of the optimization problem? (x1=?,x2=?,z=?) Show your work V) Which change will make the problem have multiple optimal solutions? If there is more than one answer, choose all.a) Increase of the coefficient of ?1 on the objective function to 4b) Increase of the coefficient of ?1 on the objective function to 2c) Decrease of the coefficient of ?1 on the objective function to -8d) Increase of the coefficient of ?2 on the objective function to -8e) None VI) If new constraints, ?1≤4 and ?2≤6, are added to the given problem, what effect will be? (choose all the effects)a) The feasible solution area will be smaller.b) The feasible solution area will…
Finco has the following investments available:Investment A For each dollar invested at time 0, we receive $0.10 at time 1 and $1.30 at time 2. (Time 0 =now;time= 1 one year from now; and so on.)Investment B For each dollar invested at time 1, we receive $1.60 at time 2.Investment C For each dollar invested at time 2, we receive $1.20 at time 3.At any time, leftover cash may be invested in T-bills, whichpay 10% per year. At time 0, we have $100. At most, $50can be invested in each of investments A, B, and C. Formulate an LP that can be used to maximize Finco’s cash onhand at time 3.