1. Given the following linear programming model: Minimize Z = 480x1 + 160x2 subject to x1 + x2 >= 40 x1 + 4x2 >= 60 3x1 + x2 >= 60 x1 >= 0, x2 >= 0 a. Solve the LP model graphically and explain the solution result. b. Develop a spreadsheet model and solve using Excel Solver. What is the optimal solution?

1. Given the following linear programming model: Minimize Z = 480x1 + 160x2 subject to x1 + x2 >= 40 x1 + 4x2 >= 60 3x1 + x2 >= 60 x1 >= 0, x2 >= 0 a. Solve the LP model graphically and explain the solution result. b. Develop a spreadsheet model and solve using Excel Solver. What is the optimal solution?

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter7: Nonlinear Optimization Models

Section: Chapter Questions

Problem 49P: If a monopolist produces q units, she can charge 400 4q dollars per unit. The variable cost is 60...

See similar textbooks

Similar questions

If a monopolist produces q units, she can charge 400 4q dollars per unit. The variable cost is 60 per unit. a. How can the monopolist maximize her profit? b. If the monopolist must pay a sales tax of 5% of the selling price per unit, will she increase or decrease production (relative to the situation with no sales tax)? c. Continuing part b, use SolverTable to see how a change in the sales tax affects the optimal solution. Let the sales tax vary from 0% to 8% in increments of 0.5%.
Seas Beginning sells clothing by mail order. An important question is when to strike a customer from the companys mailing list. At present, the company strikes a customer from its mailing list if a customer fails to order from six consecutive catalogs. The company wants to know whether striking a customer from its list after a customer fails to order from four consecutive catalogs results in a higher profit per customer. The following data are available: If a customer placed an order the last time she received a catalog, then there is a 20% chance she will order from the next catalog. If a customer last placed an order one catalog ago, there is a 16% chance she will order from the next catalog she receives. If a customer last placed an order two catalogs ago, there is a 12% chance she will order from the next catalog she receives. If a customer last placed an order three catalogs ago, there is an 8% chance she will order from the next catalog she receives. If a customer last placed an order four catalogs ago, there is a 4% chance she will order from the next catalog she receives. If a customer last placed an order five catalogs ago, there is a 2% chance she will order from the next catalog she receives. It costs 2 to send a catalog, and the average profit per order is 30. Assume a customer has just placed an order. To maximize expected profit per customer, would Seas Beginning make more money canceling such a customer after six nonorders or four nonorders?
Company aims to determine the optimal number of products to be produced in order to maximize the total profit. a) Formulate the problem using algebraic method. b) Solve the model using the graphical method (indicate optimal solution and profit). C) again). Use graphical method to determine the shadow price for each of these resources (based on the definition of shadow price and by increasing each resource by one unit and solving the problem d) Use the Excel solver to do parts b and c. e) follow: Using Solver Table generate the optimal solution and the total profit for each resource as e1: Consider unit profit for product 1 (use range from 0 to 4 and increment of 1) e2: Consider unit profit for product 2 (use range from 0 to 4 and increment of 1) е3: Consider simultaneous changes for both unit profits in part e1 and e2 using given ranges. e4: Consider available resource of Raw material 1 (use range from 2 to 14 and increment of 1) e5: Consider available resource of Raw material 2 (use…
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
1. Formulate a linear or integer model (clearly statedecision variables, objective, and constraints) 2. Find the optimal solution using Excel Solver 3. Do not solve graphically 4. Answer all questions 5. Attach your solver files and formulations.
(b) Indicate whether the following linear program is an all-integer linear program or a mixed-integer linear program. Max 3x1 + 4x2 s.t. 2x1 + 4x2 2 8> 2x1 + 6x2 2 12 x1, x2 2 0 and integer This is a Max s.t. Write the LP Relaxation for the problem but do not attempt to solve. If required, round your answers to one decimal place. Its LP Relaxation is 2x1 + x1, x2 linear program. xz x1 + 6x21
Linear programming a. Change it into real world problem b. Perform the sensitivity analysis both OFC and RHS using Excel Solver C. Draw a conclusion based on your analysis.
Consider the following linear programming model: maximize Z = 3x1 + 2x2 subject to : x1 +x2 ≤ 1 x1 + x2 ≥ 2 x1,x2 ≥ 0 a) Write this model in a standard (augmented) form. (i.e. Introduce slack/surplus, artificial etc.)b) Constract the initial simplex tableau and carry on your calculations to solve this model using the simplex method. Interpret your result.
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…
9. Which of the following is NOT a requirement of a linear programming problem? Select one: a. constraints, expressed as linear equations or inequalities b. an objective function to be maximized or minimized c. an objective function, expressed in linear terms d. alternative courses of action e. one constraint for each decision variable
advertisin wants for 4 months at a cost of $155 per square foot. Similarly, at the start of month 3 they can lease any amount of space for 2 months at a cost of $95 per square foot. The company wants to determine the least costly way of meeting their warehousing needs over the coming 5 months. a. Formulate an LP model for this problem. b. Create a spreadsheet model for this problem and solve it using Solver. c. What is the optimal solution? d. How much would it cost the company to meet its space needs if in each month it leases for 1 month exactly the amount of space required for the month? 27. A manufacturer of prefabricated homes has decided to subcontract four components of the homes. Several companies are interested in receiving this business, but none can handle more than one subcontract. The bids made by the companies for the various subcontracts are summarized in the following table. er ber ads and wing table su ber of new ost per Ad $1,000 $900 Bids by Companies (in $1,000s)…
Consider the following problem. Maximize Subject to Solving Linear Programming Problems: Graphical and The Simp Solution 2x₁ + x₂ ≤ 6 x₁ + 2x₂ ≤ 6 X1, X₂ ≥ 0 Z = 3x₁ + 2x₂ a. Use the graphical method to solve this problem. b. Use the tabular simplex method to solve this problem. a. Graphical Method