Spreadsheet Modeling & Decision Analysis: A Practical Introduction to Business Analytics (MindTap Course List)
8th Edition
ISBN: 9781305947412
Author: Cliff Ragsdale
Publisher: Cengage Learning
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 6, Problem 3QP
a)
Summary Introduction
To determine: optimal solution of the linear programming problem.
b)
Summary Introduction
To determine: optimal solution if X1 and X2 should be an integer.
c)
Summary Introduction
To determine: general principles of integer programming.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Use simplex method for linear programming. Show solution for each iteration table.
Problem: A small firm that assembles computers is about to start production of two new types of personal computers. Each type will require assembly time, inspection time, and storage space. The amount of each of these resources that can be devoted to the production of the computers is limited. The manager of the firm would like to determine the quantity of each computer to produce in order to maximize the profit generated by sales of these computers. In order to develop a suitable model of the problem, the manager has met with design and manufacturing personnel. As a result of those meetings, the manager has obtained the following information:Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Type 1 Â Â Â Â Â Â Â Type 2
Profit per unit                   $60           $50
Assembly time per unit           4 hours       10 hoursÂ
Inspection time per…
A linear programming computer package is needed.
Georgia Cabinets manufactures kitchen cabinets that are sold to local dealers throughout the Southeast. Because of a large
backlog of orders for oak and cherry cabinets, the company decided to contract with three smaller cabinetmakers to do the
final finishing operation. For the three cabinetmakers, the number of hours required to complete all the oak cabinets, the
number of hours required to complete all the cherry cabinets, the number of hours available for the final finishing
operation, and the cost per hour to perform the work are shown here.
Cabinetmaker 1 Cabinetmaker 2 Cabinetmaker 3
Hours required to complete
all the oak cabinets
50
42
30
Hours required to complete
all the cherry cabinets
60
48
35
Hours available
40
30
35
Cost per hour
$36
$42
$55
For example, Cabinetmaker 1 estimates it will take 50 hours to complete all the oak cabinets and 60 hours to complete all
the cherry cabinets. However, Cabinetmaker 1 only has 40 hours…
Which 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
y20
Chapter 6 Solutions
Spreadsheet Modeling & Decision Analysis: A Practical Introduction to Business Analytics (MindTap Course List)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, management and related others by exploring similar questions and additional content below.Similar questions
- Problem 2: Applications of Linear Programming: Visa Inc. Stock sells for $92 a share and has 3-year average annual return of $20 a share. The beta value is 1.06. JP Morgan Chase and Co. sells for $87 a share and has a 3-year average annual return of $17 a share. The beta value is 1.21. Derek wants to spend no more than $15,000 investing in these two stocks, but he wants to earn at least $2500 in annual revenue. Derek also wants to minimize the risk. Determine the number of shares of each stock that Derek should buy.arrow_forwardSolve 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 ≥ 0arrow_forward. 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) كلا أجرب الأرقام بالـؤالarrow_forward
- WhAt is Integer Linear Optimization and how it is solved?arrow_forward1. 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_forwardList some perspectives on solving integer programming problems?arrow_forward
- What are the benefits of linear programming models ?arrow_forward3. (Note: This is a variation of problem 6 of chapter 16 in your textbook.) Kenya and Dionne live on adjacent plots of land. Each has two potential uses for their land, the present values of each of which depend on the use adopted by the other, as summarized in the table. All the values in the table are known to both parties. Dionne Rental housing Bee keeping Kenya Apple growing A: $200 B: $700 A: $400 B: $650 Pig farming A: $450 B: $400 A: $450 B: $500 a. What is the efficient outcome? b. If there are negotiation costs of $150, what activities will the two pursue on their land? c. If there are no negotiation costs and the two negotiate, what activities will the two pursue on their land? How might a benevolent planner help reduce the costs of negotiating to encourage the optimal combination of land uses?arrow_forwardScenario You are going to plant a rectangular flower bed consisting of tulips in the middle surrounded by daisies on the outside. You have the same amount of each flower and will need an equal area for each. You want the border of daisies to be uniform around the tulips in the middle, as shown in the diagram below:arrow_forward
- Elaborate/ Explain Integer Linear Optimization and put examplesarrow_forwardSolve the following linear programming problem. Restrict X>0 and y ≥ 0. Maximize f= 2x + 5y subject to X 2x + + (x, y) y s 9 y s y || = f = VI 12 8.arrow_forwardNext question Use the simplex method to solve the linear programming prob z= 8x1 - 7x2 + 4x3 2x1 Maximize X2 + 8x3 s 40 4x1 - 5x2 + 6x3576 2x1 - 2x2 + 6x3< 32 X120, X2 20, хз 20. subject to Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. A. The maximum is , X2 =, X3 = S2 = and s3 when X1 S1 = B. There is no maximum.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,
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,