
Practical Management Science
6th Edition
ISBN: 9781337406659
Author: WINSTON, Wayne L.
Publisher: Cengage,
expand_more
expand_more
format_list_bulleted
Question

Transcribed Image Text:Consider the following Integer Linear Program:
Minimise:
5x₁ + 4x2
Subject to:
X1
X1
3x1
(1)
+
(iii)
X2
4x2
>
6
12
+
+ X2 ≥ 9
X₁, X2 ≥ 0 and integer
Construct the initial tableau for this problem including all decision,
slack and artificial variables. You should assume the M-method will be
used to solve this, so build the tableau with the objective function
coefficients for any artificial variables set to -M.
(ii)
In the optimal solution to the (non-integer) relaxation of this problem,
X₁ and X2 are both basic and the second constraint is a strict inequality.
Using any method you like (including computer software), derive the
transformation matrix for the optimal solution to the relaxation of this
problem, and use it to construct an optimal tableau for the non-integer
LP (you can assume that the solution is feasible, so no columns for the
artificial variables are needed).
From the tableau you derived in (ii) above, use the dual simplex
method to find the optimal solution to the integer LP. You should
examine (at least) two distinct additional constraints on one of the
decision variables to verify that your solution is optimal for the integer
LP
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by stepSolved in 4 steps with 12 images

Knowledge Booster
Similar questions
- In the problem on excel : 1.What are the decision variables 2.What is the objective functions 3. What are the constraints and explainarrow_forwardWhich of the folowing linear programming model has an unbounded feasible region? = 3x + 2y subject to the following : O max z x+ y34 *< 10 – 4y x20 y20 O None of the above O max z = 3x + 2y subject to the following : x+ 2y <4 x- ys1 x20 y20 O max z = 4x +2y subject to the following : x + 2y 24 3x + y27 -x + 2y s7 x20 y20arrow_forwardI don't need handwritten answer. Only typed answer is allowed. The figure also should not be hand drawn.arrow_forward
- For your next 10k race of the athletics season, you consider competing in either Sheffield, Cardiff, or Birmingham. After considering results from past years and the three different routes, you estimate your prize money, which will also depend on your form on the day. These estimated prizes are shown in the following table: Good form Average form Bad form 0 Sheffield 1000 Cardiff 700 Birmingham 800 400 500 600 200 100 Which condition must a satisfy such that Birmingham is the optimal city to go compete, according to the optimism-pessimism rule?arrow_forwardEstimate a range for the optimal objective value for the following LPs: *(a) Minimize z = 5x₁ + 2x₂ subject to (b) Maximize z subject to x₁ + 5x₂ + 3x3 X₁ X₂ ≥ 3 2x₁ + 3x₂ = 5 X1, X₂ ≥ 0 x₁ + 2x₂ + x3 = 30 2x₁ - x₂ = 40 X1, X2, X3 ≥ 0arrow_forwardThe sketch of a feasible region is given below, which point is not a point consistent with a production option for this programming problem? (0,10) (0,8) (0,0) O (0,6) O (4,0) O (4,2) O (6,0) (2,8) (6,4) (6,0) 27 (10,0) They are all in the feasible region.arrow_forward
- Bugs Bunny and Daffy Duck are contestants on a game show called Split or Steal. On the show, Bugs and Daffy have to pick one of two cards and decide to split the prize money of $100,000 or steal it from the other contestant. The decisions are made simultaneously so neither player knows what the other will do. The table below represents the result of the contestants’ choices. See attached What should a rational player do in this game? Is this a zero-sum game?arrow_forwardSeneca Hill Winery recently purchased land for the purpose of establishing a new vineyard.Management is considering two varieties of white grapes for the new vineyard: Chardonnayand Riesling. The Chardonnay grapes would be used to produce a dry Chardonnay wine,and the Riesling grapes would be used to produce a semidry Riesling wine. It takes approximatelyfour years from the time of planting before new grapes can be harvested. Thislength of time creates a great deal of uncertainty concerning future demand and makes thedecision about the type of grapes to plant difficult. Three possibilities are being considered:Chardonnay grapes only; Riesling grapes only; and both Chardonnay and Riesling grapes.Seneca management decided that for planning purposes it would be adequate to consideronly two demand possibilities for each type of wine: strong or weak. With two possibilitiesfor each type of wine, it was necessary to assess four probabilities. With the help of someforecasts in industry…arrow_forwardAssume that $1,285,673 is to be invested in a project whose annual projected cash flows are as follows: Year 1 = $235,678, Year 2 = $267,854, Year 3 = $298,054, Year 4 = $314,567, and Year 5 = $325,678. Assume that the required rate of return is 5.25%. Compute the NPV by using Microsoft Excel's NPV function. Be sure to show your work. Should the project be pursued? Why or why not?arrow_forward
- 1. A specific assignment of values to decision variables is called what? a. Constraint b. Feasible c. Solution d. None of the above 2. Which of the following must be true of a feasible solution a. All of what Solver calls changing variables must be greater than 0 b. It is optimal c. It violates no constraints d. None of the abovearrow_forwardMonsters, Inc. has two plants for producing electricity, one in Monsterville and another is in New Yeti. The Monsterville plant produces according to eM(x1,x2) = min{xX1,2x2} and the New Yeti plant produces according to eNY(x1,x2) = min{2x1,x2}, where xi and x2 are the inputs. iii. How much of each input will the firm need in order to produce 20 units electricity in the New Yeti plant? iv. Assume now that Monsters, Inc. decides to produce 40 units of electricity and it can split production in any manner between the two plants. Is the technology available to this firm convex or concave? Explain your answer.arrow_forward1. Write a linear program for the problem. 2. What is the optimal production mix among different coffee varieties and the profit associated with it? 3. What should be the per bag profit of Tarrazu which will make it beneficial to produce this variety? 4. One Cup is considering increasing the weekly bags to 150. If it costs One Cup $3.00 per bag to procure beans of any variety. Conduct sensitivity analysis and determine if One Cup should consider increasing the per week production. 5. Identify the range over which per bag profit of Sumatra and Kona may vary and still retain the current production plan as optimal for One Cup. 6. Once roasted the coffee beans must be preserved properly. To ensure that, One Cup Coffee is considering investing in a vacuum packaging machine for 24 hours/ week. It takes 10, 15 and 10 minutes to pack a bag of Sumatra, Kona and Tarazzu respectively. Identify if the current production plan will suit the installation of the new packaging scheme.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,Operations ManagementOperations ManagementISBN:9781259667473Author:William J StevensonPublisher:McGraw-Hill EducationOperations and Supply Chain Management (Mcgraw-hi...Operations ManagementISBN:9781259666100Author:F. Robert Jacobs, Richard B ChasePublisher:McGraw-Hill Education
- Purchasing and Supply Chain ManagementOperations ManagementISBN:9781285869681Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. PattersonPublisher:Cengage LearningProduction and Operations Analysis, Seventh Editi...Operations ManagementISBN:9781478623069Author:Steven Nahmias, Tava Lennon OlsenPublisher:Waveland Press, Inc.

Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,

Operations Management
Operations Management
ISBN:9781259667473
Author:William J Stevenson
Publisher:McGraw-Hill Education

Operations and Supply Chain Management (Mcgraw-hi...
Operations Management
ISBN:9781259666100
Author:F. Robert Jacobs, Richard B Chase
Publisher:McGraw-Hill Education


Purchasing and Supply Chain Management
Operations Management
ISBN:9781285869681
Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Publisher:Cengage Learning

Production and Operations Analysis, Seventh Editi...
Operations Management
ISBN:9781478623069
Author:Steven Nahmias, Tava Lennon Olsen
Publisher:Waveland Press, Inc.