A firm has prepared the following binary integer program to evaluate a number of potential locations for newwarehouses. The firm's goal is to maximize the net present value of their decision while not spending more thantheir currently available capital.Max 20x1 + 30x2 + 10x3 + 15x4s.t. 5x1 + 7x2 + 12x3 + 11x4 ≤ 21 {Constraint 1}X1 + X2 + x3 + x4 ≥ 2 {Constraint 2}X1 + X2 ≤ 1 {Constraint 3}X1 + X3 ≥ 1 {Constraint 4}X2 = x4 {Constraint 5}xj1, if loaction j is selected0, otherwiseWhich of the constraints ensures that at least two of the potential sites will be selected? Multiple ChoiceOOOConstraint 1Constraint 2Constraint 3Constraint 4Constraint 5

This is a Binary integer program problem. BIP means either 1 or 0 will be the selected value of any…

Answered: A firm has prepared the following…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter2: Introduction To Spreadsheet Modeling

Section: Chapter Questions

Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...

See similar textbooks

Similar questions

Gerald Glynn manages the Michaels Distribution Center. After careful examination of his database information, he has determined the daily requirements for part-time loading dock personnel. The distribution center operates 7 days a week, and the daily part-time staffing requirements are Day M T W Th F S Su Requirements 7 3 5 5 6 2 2 Find the minimum number of workers Glynn must hire. Prepare a workforce schedule for these individuals so that each will have 2 consecutive days off per week and all staffing requirements will be satisfied. Give preference to the S-Su pair in case of a tie. (Note: If there is a tie that cannot be broken by following the preference to the S-Su pair, choose the pair closest to the beginning of the considered week.) Part 2 The minimum number of workers is _________workers. (Enter your response as a…
A beer distributor needs to plan how to make deliveries from its warehouse (node 1) to a supermarket (node 7), as shown in the network below. s.t. Node 1 Flows Node 2 Flows Node 3 Flows Node 4 Flows Node 5 Flows Node 6 Flows 1 Node 7 Flows 3 Develop the LP formulation for finding the shortest route from the warehouse to the supermarket. (Let x₁, represent the flow from node i to node j.) +9x56 + Min 3x12 + 3x15 + 11x16 + 6x23 + 5x34 + 3x46 +4x47 3 Xij > 0 for all i and j 11 *12+*15 +*16 *12*23 *23 + x34 x47+x46 = 1 6 X *16*56 +46-67 *47 +x67 9 = 0 5 X 4 3 3x67 X
1. Ethan Steel, Inc. has two factories that manufacture steel components for two different rail projects located at two different sites. They would like to determine the number of steel components they need to transport from each factory to each project site. The demand for the steel components for the two projects, Project A, and Project B are 3000, and 4000, respectively. The production and shipping details are as below:Production details:Factory 12Maximum capacity 20005000Shipping details (with per-unit shipping cost in dollars):Project Factory A B 178265Develop a linear programming optimization model to determine the distribution plan (from factories to projects) that minimizes the total transportation cost. (Do NOT solve the model.)
A cement company has 3 (three) factories in different locations, namely in A, B, and C. Production costs in A are Rp. 600,000 per ton, in B Rp. 400,000 per ton and in C Rp. 500,000,- per ton. Each factory currently only produces 100,000 tons per day according to market demand, even though the actual installed capacity of the three factories can produce 120,000 tons per day. The company sends production from the three factories to 3 (three) distributor locations, namely X, Y, and Z. The demand for Distributor X is 100,000 tons per day, Distributor Y is 120,000 tons per day, and Distributor Z is 80,000 tons per day. The company wants to use warehouses located at J and K with a storage capacity of 125,000 tons and 175,000 tons per day respectively and shipping costs (in thousands of rupiah) as shown in the table below. The value "M" means it is not possible to make a delivery. Note: “x” in the table denoted by the last number of your ID number. Example, if my ID is 2602296545, then the…
Problem 8-21 (Algorithmic) Round Tree Manor is a hotel that provides two types of rooms with three rental classes: Super Saver, Deluxe, and Business. The profit per night for each type of room and rental class is as follows: Rental Class Room Super Saver Deluxe Business Type I $30 $35 — Type II $20 $30 $40 Type I rooms do not have wireless Internet access and are not available for the Business rental class. Round Tree's management makes a forecast of the demand by rental class for each night in the future. A linear programming model developed to maximize profit is used to determine how many reservations to accept for each rental class. The demand forecast for a particular night is 130 rentals in the Super Saver class, 60 rentals in the Deluxe class, and 50 rentals in the Business class. Round Tree has 100 Type I rooms and 120 Type II rooms. Use linear programming to determine how many reservations to accept in each rental class and how the reservations should be…
A payoff matrix has to be prepared with three alternative products Α1 , Α2 and Α3 . The respective cost costs of these products are K2, K2.50 and K4 per unit and their sale prices are K3, K4 and K5 per unit respectively. The normal production capacity of the plant for production of each of the products Α1 , Α2 and Α3 is 3,000, 2,000 and 1,000 units respectively. i. Showing all the working clearly, prepare the payoff table if the states of demand are high (S1 ) , moderate (S2 ) and low (S3 ) with respective demand levels of 3,000, 2,000 and 1, 000 units. The stocks unsold will be worth half the cost price for the next period. ii. What is the maximax decision? iii. What is the maximin decision? iv. What is equally likely decision? v. What is the criterion of realism decision? Use α = 0.8 vi. Develop an opportunity loss table and determine the minimax decision.
An IE graduate student named Vladimir will soon purchase a new top of the line Apple iPhone or Samsung Galaxy. He bases his choice on the three factors: cost C, ease of use E, and features F. He assigns weights of 0.40 to C, 0.30 to E, and 0.30 to F. For C, he assigns weights of 0.40 to iPhone and 0.60 to Galaxy. For E, he also assigns weights of 0.40 to iPhone and 0.60 to Galaxy. For F, he assigns weights of 0.70 to iPhone and 0.30 to Galaxy. Use these weights in a value tree and determine which phone Vladimir should buy and the corresponding overall weight for the chosen phone. iPhone, 0.53 O Galaxy, 0.51 O iPhone, 0.51 O Galaxy, 0.49 « Previous Next> Simpfun
The Acme Company operates four factories that ship products to five warehouses. The shipping costs, requirements capacities, and optimal allocations are shown in Figure. What is the total cost of the optimal solution?
ld by the m to spoilage Ho manufacre d 3-27 Farm Grown Umation. 2:3-24 Today's Electronics specializes in manufacturing modern electronic components. It also builds the equipment that produces the components. Phyl- lis Weinberger, who is responsible for advising the president of Today's Electronics on electronic manu- facturing equipment, has developed the following table concerning a proposed facility: products. Each etables and and sells for the end of cessing daily demand ity that daily the probability is 0.3. Farm Gro PROFIT ($) POOR customer demand Tos than the demand, I STRONG FAIR MARKET MARKET MARKET from a competiton is $16 per case. 550,000 110,000 -310,000 Large facility (a) Draw a decision table (b) What do you recomnen 300,000 129,000 -100,000 Medium-sized facility :3-28 In Problem 3-27m believe the probs Small facility 200,000 100,000 -32,000 to changing conons. ignored, what deon wa No facility (a) Develop an opportunity loss table. (b) What is the minimax regret…
A manufacturing company has 4 factories and 3 warehouses. The costs for transporting its products from factories to ware houses, the supply capacity of factories and demands in warehouses are given respectively by 6 4 81 70 170 4 3 2 C = 130 S = D= 200 2 4 7 100 130 1 5 8 200 a. Use minimum cost method to find an initial feasible solution. b. Determine the amount of products to be transported from factories to warehouses to minimize the cost.
Monica and Isabel are roommates who, on this particular Saturday morning, are trying to decide what scarf to wear. Each has a Burberry scarf (which we’ll denote B), a tan scarf (denoted T), and a mauve scarf (denoted M). They care about the scarf but also about whether they end up wearing the same or different scarves. The preference ordering (from best to least preferred outcome) for Monica is: (1) she wears B and Isabel wears T or M; (2) she wears T and Isabel wears B or M; (3) she wears B and Isabel wears B; (4) she wears T and Isabel wears T: (5) she wears M and Isabel wears M; and (6) she wears M and Isabel wears B or T. Isabel’s preference ordering is: (1) she wears T and Monica wears B or M; (2) she wears M and Monica wears B or T; (3) she wears T and Monica wears T; (4) she wears M and Monica wears M; (5) she wears B and Monica wears B; and (6) she wears B and Monica wears T or M. Applying the IDSDS, which scarves will be worn?
2

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

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

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

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

Business in Action

Operations Management

ISBN:

9780135198100

Author:

BOVEE

Publisher:

PEARSON CO

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.

SEE MORE TEXTBOOKS