Student Suite Cd-rom For Winston's Operations Research: Applications And Algorithms
Student Suite Cd-rom For Winston's Operations Research: Applications And Algorithms
4th Edition
ISBN: 9780534423551
Author: Wayne L. Winston
Publisher: Cengage Learning
Question
Book Icon
Chapter 3, Problem 1RP
Program Plan Intro

Linear programming (LP):

  • The linear programming(LP) is also known as linear optimization.
  • Consider a mathematical model, and its requirements are used to represent by the linear relationships. The linear programming is the best method to achieve the best outcome of this mathematical model. The outcomes may be, maximum profit or lower cost.
  • The linear optimization is also called as mathematical optimization because, it is a special case of mathematical programming.
  • More formally, the LP is a technique for optimizing linear objective function subject to constraints of linear equality and linear inequality.

Expert Solution & Answer
Check Mark

Explanation of Solution

Linear programming for solving the problem:

  Let x= barrels of beer produced

  y= barrels of ale produced

  Then,

  maxz=5x+2y5x+2y602x+y25x,y0

Explanation:

  • The above programming statements are used to solve the beer and ale problem. In this there are two variables “x” and “y” used to represent the barrels of beer produced and barrels of ale produced respectively.
  • The above statements give the formula to maximize the profit. Which is “5x + 2y”.

Solving LP graphically:

 BeerAleTotal
Corn5lb2lb60
Hopes2lb1lb25

Let x=amount of beer

y=amount of ale

5x+2y60,x02x+1y25,y0maximize=5x+2y

LP graph:

Student Suite Cd-rom For Winston's Operations Research: Applications And Algorithms, Chapter 3, Problem 1RP

Vertices are, (12,0),(10,5),(0,25)

Profit function: 5x+2y

The profit function at (12,0)=5×12+2×0=60

The profit function at (0,25)=5×0+2×25=50

The profit function at (10,5)=5×10+5×2=50+10=60

The profit is maximized at the points, (10,5) and (12,0).

That is 10 barrels of beer and 5 barrels of ale.

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
The Touche Young accounting firm must complete three jobs during the next month. Job 1 will require 500 hours of work, job 2 will require 300 hours of work, and job 3 will require 100 hours of work. Currently, the firm consists of 5 partners, 5 senior employees, and 5 junior employees, each of whom can work up to 40 hours per month. The dollar amount (per hour) that the company can bill depends on the type of accountant who is assigned to each job, as shown in the table below. (The X indicates that a junior employee does not have enough experience to work on job 1.) All jobs must be completed. Touche Young has also set the following goals, listed in order of priority:  Goal 1: Monthly billings should exceed $68,000.  Goal 2: At most, 1 partner should be hired.  Goal 3: At most, 3 senior employees should be hired. Goal 4: At most, 5 junior employees should be hired. Formulate a preemptive goal programming model for thissituation
3. A company is considering opening warehouses in four cities: New York, Los Angeles, Chicago, and Atlanta. Each warehouse can ship 100 units per week. The weekly fixed cost of keeping each warehouse open is $400 for New York, $500 for Los Angeles, $300 for Chicago, and $150 for Atlanta. Region 1 of the country requires 80 units per week, region 2 requires 70 units per week, and region 3 requires 40 units per week. The costs (including production and shipping costs) of sending one unit from a plant to a region are shown in Table 3. We want to meet weekly demands at minimum cost, subject to the preceding information and the following restrictions: 1. If the New York warehouse is opened, then the Los Angeles warehouse must be opened. 2. At most two warehouses can be opened. 3. Either the Atlanta or the Los Angeles warehouse must be opened. Formulate an IP that can be used to minimize the weekly costs of meeting demand. Table 3 To ($) From Region 1 Region 2 Region 3 New York 20 40 50 Los…
Q1: Reddy Mikks produces both interior and exterior paints from two raw materials, M1 and M2. The following table provides the basic data of the problem: Tons of raw material per ton of Maximum daily availability (tons) Exterior paint Interior paint Raw material, M1 6 4 24 Raw material, M2 1 2 6 Profit per ton ($1000) 5 4 The daily demand for interior paint cannot exceed that for exterior paint by more than 1 ton. Also, the maximum daily demand for interior paint is 2 tons. Reddy Mikks wants to determine the optimum (best) product mix of interior and exterior paints that maximizes the total daily profit. Give the mathematical formula of only the demand constraint? (15 mark) Note for form's designer: design the answer to be as a short paragraph. إجابتك

Chapter 3 Solutions

Student Suite Cd-rom For Winston's Operations Research: Applications And Algorithms

Ch. 3.2 - Prob. 6PCh. 3.3 - Prob. 1PCh. 3.3 - Prob. 2PCh. 3.3 - Prob. 3PCh. 3.3 - Prob. 4PCh. 3.3 - Prob. 5PCh. 3.3 - Prob. 6PCh. 3.3 - Prob. 7PCh. 3.3 - Prob. 8PCh. 3.3 - Prob. 9PCh. 3.3 - Prob. 10PCh. 3.4 - Prob. 1PCh. 3.4 - Prob. 2PCh. 3.4 - Prob. 3PCh. 3.4 - Prob. 4PCh. 3.5 - Prob. 1PCh. 3.5 - Prob. 2PCh. 3.5 - Prob. 3PCh. 3.5 - Prob. 4PCh. 3.5 - Prob. 5PCh. 3.5 - Prob. 6PCh. 3.5 - Prob. 7PCh. 3.6 - Prob. 1PCh. 3.6 - Prob. 2PCh. 3.6 - Prob. 3PCh. 3.6 - Prob. 4PCh. 3.6 - Prob. 5PCh. 3.7 - Prob. 1PCh. 3.8 - Prob. 1PCh. 3.8 - Prob. 2PCh. 3.8 - Prob. 3PCh. 3.8 - Prob. 4PCh. 3.8 - Prob. 5PCh. 3.8 - Prob. 6PCh. 3.8 - Prob. 7PCh. 3.8 - Prob. 8PCh. 3.8 - Prob. 9PCh. 3.8 - Prob. 10PCh. 3.8 - Prob. 11PCh. 3.8 - Prob. 12PCh. 3.8 - Prob. 13PCh. 3.8 - Prob. 14PCh. 3.9 - Prob. 1PCh. 3.9 - Prob. 2PCh. 3.9 - Prob. 3PCh. 3.9 - Prob. 4PCh. 3.9 - Prob. 5PCh. 3.9 - Prob. 6PCh. 3.9 - Prob. 7PCh. 3.9 - Prob. 8PCh. 3.9 - Prob. 9PCh. 3.9 - Prob. 10PCh. 3.9 - Prob. 11PCh. 3.9 - Prob. 12PCh. 3.9 - Prob. 13PCh. 3.9 - Prob. 14PCh. 3.10 - Prob. 1PCh. 3.10 - Prob. 2PCh. 3.10 - Prob. 3PCh. 3.10 - Prob. 4PCh. 3.10 - Prob. 5PCh. 3.10 - Prob. 6PCh. 3.10 - Prob. 7PCh. 3.10 - Prob. 8PCh. 3.10 - Prob. 9PCh. 3.11 - Prob. 1PCh. 3.11 - Show that Finco’s objective function may also be...Ch. 3.11 - Prob. 3PCh. 3.11 - Prob. 4PCh. 3.11 - Prob. 7PCh. 3.11 - Prob. 8PCh. 3.11 - Prob. 9PCh. 3.12 - Prob. 2PCh. 3.12 - Prob. 3PCh. 3.12 - Prob. 4PCh. 3 - Prob. 1RPCh. 3 - Prob. 2RPCh. 3 - Prob. 3RPCh. 3 - Prob. 4RPCh. 3 - Prob. 5RPCh. 3 - Prob. 6RPCh. 3 - Prob. 7RPCh. 3 - Prob. 8RPCh. 3 - Prob. 9RPCh. 3 - Prob. 10RPCh. 3 - Prob. 11RPCh. 3 - Prob. 12RPCh. 3 - Prob. 13RPCh. 3 - Prob. 14RPCh. 3 - Prob. 15RPCh. 3 - Prob. 16RPCh. 3 - Prob. 17RPCh. 3 - Prob. 18RPCh. 3 - Prob. 19RPCh. 3 - Prob. 20RPCh. 3 - Prob. 21RPCh. 3 - Prob. 22RPCh. 3 - Prob. 23RPCh. 3 - Prob. 24RPCh. 3 - Prob. 25RPCh. 3 - Prob. 26RPCh. 3 - Prob. 27RPCh. 3 - Prob. 28RPCh. 3 - Prob. 29RPCh. 3 - Prob. 30RPCh. 3 - Graphically find all solutions to the following...Ch. 3 - Prob. 32RPCh. 3 - Prob. 33RPCh. 3 - Prob. 34RPCh. 3 - Prob. 35RPCh. 3 - Prob. 36RPCh. 3 - Prob. 37RPCh. 3 - Prob. 38RPCh. 3 - Prob. 39RPCh. 3 - Prob. 40RPCh. 3 - Prob. 41RPCh. 3 - Prob. 42RPCh. 3 - Prob. 43RPCh. 3 - Prob. 44RPCh. 3 - Prob. 45RPCh. 3 - Prob. 46RPCh. 3 - Prob. 47RPCh. 3 - Prob. 48RPCh. 3 - Prob. 49RPCh. 3 - Prob. 50RPCh. 3 - Prob. 51RPCh. 3 - Prob. 52RPCh. 3 - Prob. 53RPCh. 3 - Prob. 54RPCh. 3 - Prob. 56RPCh. 3 - Prob. 57RPCh. 3 - Prob. 58RPCh. 3 - Prob. 59RPCh. 3 - Prob. 60RPCh. 3 - Prob. 61RPCh. 3 - Prob. 62RPCh. 3 - Prob. 63RP
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole