Skip to main content

Engineering Computer Science Introduction to mathematical programming

LP formulation: The following example of LP is to show that it has more than one optimal solution. It also contains nondegenerate basic feasible solution and there is non-basic variable in row 0 with a zero coefficient. max z=6x 1 +4x 2 Such that x 1 + 2 x 2 ≤ 16 3 x 1 + 2 x 2 ≤ 24 x 1 , x 2 ≥ 0 Solving by the simplex method, the initial table is, c j 6 4 0 0 Ratio c j x j B j x 1 x 2 S 1 S 2 ( B i x 1 ) 0 S 1 16 1 2 1 0 16 0 S 2 24 3 2 0 1 8 z j − c j -6 -4 0 0 Here x 1 will enter as it is the greatest negative value

LP formulation: The following example of LP is to show that it has more than one optimal solution. It also contains nondegenerate basic feasible solution and there is non-basic variable in row 0 with a zero coefficient. max z=6x 1 +4x 2 Such that x 1 + 2 x 2 ≤ 16 3 x 1 + 2 x 2 ≤ 24 x 1 , x 2 ≥ 0 Solving by the simplex method, the initial table is, c j 6 4 0 0 Ratio c j x j B j x 1 x 2 S 1 S 2 ( B i x 1 ) 0 S 1 16 1 2 1 0 16 0 S 2 24 3 2 0 1 8 z j − c j -6 -4 0 0 Here x 1 will enter as it is the greatest negative value

Solution Summary: The author analyzes the LP formulation to show that it has more than one optimal solution and non-degenerate basic feasible solution.

Introduction to mathematical programming

Introduction to mathematical programming

4th Edition

ISBN: 9780534359645

Author: Jeffrey B. Goldberg

Publisher: Cengage Learning

See similar textbooks

Expert Solution & Answer

Chapter 3, Problem 7RP

Explanation of Solution

LP formulation:

The following example of LP is to show that it has more than one optimal solution.

It also contains nondegenerate basic feasible solution and there is non-basic variable in row 0 with a zero coefficient.

max z=6x₁+4x₂

Such that

x1+2x2≤16

3x1+2x2≤24

x1,x2≥0

Solving by the simplex method, the initial table is,

c_j 6 4 0 0 Ratio
c_j x_j B_j x₁ x₂ S₁ S₂ (Bix1)
0 S₁ 16 1 2 1 0 16
0 S₂ 24 3 2 0 1 8
zj−cj -6 -4 0 0

Here x₁ will enter as it is the greatest negative value

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

Blurred answer

Chapter 3, Problem 6RP

Chapter 3, Problem 8RP

Students have asked these similar questions

Steelco manufactures two types of steel at three different steel mills. During a given month, each steel mill has 200 hours of blast furnace time available. Because of differences in the furnaces at each mill, the time and cost to produce a ton of steel differs for each mill. The time and cost for each mill are shown in the table below. Each month, Steelco must manufacture at least 500 tons of steel 1 and 600 tons of steel 2. Formulate an LP to minimize the cost of manufacturing the desired steel.

Pneumatics Engineering purchased a machine that had a fi rst cost of $40,000, an expected useful life of 8 years, a recovery period of 10 years, and a salvage value of $10,000. The operating cost of the machine is expected to be $15,000 per year. The inflation rate is 6% per year and the company’s MARR is 11% per year. Determine the depreciation charge for year 3 according to the straight line method. (UNITS ARE REQUIRED)

A company manufactures three products 1, 2, and 3. Each product requires production time in three departments as shown below: PRODUCT DEPARTMENT 1 DEPARTMENT 2 DEPARTMENT 3 1 3 hr/unit 2 hr/unit 1 hr/unit 2 4 hr/unit 1 hr/unit 3 hr/unit 3 2 hr/unit 2 hr/unit 3 hr/unit There are 500, 400, and 300 hours of production time available in the three departments, respectively. If products 1, 2, and 3 contribute $3, $4, and $2.5 per unit to profit, answer the following questions: (You may attach your solution or write in the box) a) Define the decision variables (2 marks). b) Write all constraints (3 marks). c) Write the objective function (define whether it is a maximization or minimization) (1.5 marks)

Chapter 3 Solutions

Introduction to mathematical programming

Ch. 3.1 - Prob. 1P Ch. 3.1 - Prob. 2P Ch. 3.1 - Prob. 3P Ch. 3.1 - Prob. 4P Ch. 3.1 - Prob. 5P Ch. 3.2 - Prob. 1P Ch. 3.2 - Prob. 2P Ch. 3.2 - Prob. 3P Ch. 3.2 - Prob. 4P Ch. 3.2 - Prob. 5P

Ch. 3.2 - Prob. 6P Ch. 3.3 - Prob. 1P Ch. 3.3 - Prob. 2P Ch. 3.3 - Prob. 3P Ch. 3.3 - Prob. 4P Ch. 3.3 - Prob. 5P Ch. 3.3 - Prob. 6P Ch. 3.3 - Prob. 7P Ch. 3.3 - Prob. 8P Ch. 3.3 - Prob. 9P Ch. 3.3 - Prob. 10P Ch. 3.4 - Prob. 1P Ch. 3.4 - Prob. 2P Ch. 3.4 - Prob. 3P Ch. 3.4 - Prob. 4P Ch. 3.5 - Prob. 1P Ch. 3.5 - Prob. 2P Ch. 3.5 - Prob. 3P Ch. 3.5 - Prob. 4P Ch. 3.5 - Prob. 5P Ch. 3.5 - Prob. 6P Ch. 3.5 - Prob. 7P Ch. 3.6 - Prob. 1P Ch. 3.6 - Prob. 2P Ch. 3.6 - Prob. 3P Ch. 3.6 - Prob. 4P Ch. 3.6 - Prob. 5P Ch. 3.7 - Prob. 1P Ch. 3.8 - Prob. 1P Ch. 3.8 - Prob. 2P Ch. 3.8 - Prob. 3P Ch. 3.8 - Prob. 4P Ch. 3.8 - Prob. 5P Ch. 3.8 - Prob. 6P Ch. 3.8 - Prob. 7P Ch. 3.8 - Prob. 8P Ch. 3.8 - Prob. 9P Ch. 3.8 - Prob. 10P Ch. 3.8 - Prob. 11P Ch. 3.8 - Prob. 12P Ch. 3.8 - Prob. 13P Ch. 3.8 - Prob. 14P Ch. 3.9 - Prob. 1P Ch. 3.9 - Prob. 2P Ch. 3.9 - Prob. 3P Ch. 3.9 - Prob. 4P Ch. 3.9 - Prob. 5P Ch. 3.9 - Prob. 6P Ch. 3.9 - Prob. 7P Ch. 3.9 - Prob. 8P Ch. 3.9 - Prob. 9P Ch. 3.9 - Prob. 10P Ch. 3.9 - Prob. 11P Ch. 3.9 - Prob. 12P Ch. 3.9 - Prob. 13P Ch. 3.9 - Prob. 14P Ch. 3.10 - Prob. 1P Ch. 3.10 - Prob. 2P Ch. 3.10 - Prob. 3P Ch. 3.10 - Prob. 4P Ch. 3.10 - Prob. 5P Ch. 3.10 - Prob. 6P Ch. 3.10 - Prob. 7P Ch. 3.10 - Prob. 8P Ch. 3.10 - Prob. 9P Ch. 3.11 - Prob. 1P Ch. 3.11 - Show that Fincos objective function may also be...Ch. 3.11 - Prob. 3P Ch. 3.11 - Prob. 4P Ch. 3.11 - Prob. 7P Ch. 3.11 - Prob. 8P Ch. 3.11 - Prob. 9P Ch. 3.12 - Prob. 2P Ch. 3.12 - Prob. 3P Ch. 3.12 - Prob. 4P Ch. 3 - Prob. 1RP Ch. 3 - Prob. 2RP Ch. 3 - Prob. 3RP Ch. 3 - Prob. 4RP Ch. 3 - Prob. 5RP Ch. 3 - Prob. 6RP Ch. 3 - Prob. 7RP Ch. 3 - Prob. 8RP Ch. 3 - Prob. 9RP Ch. 3 - Prob. 10RP Ch. 3 - Prob. 11RP Ch. 3 - Prob. 12RP Ch. 3 - Prob. 13RP Ch. 3 - Prob. 14RP Ch. 3 - Prob. 15RP Ch. 3 - Prob. 16RP Ch. 3 - Prob. 17RP Ch. 3 - Prob. 18RP Ch. 3 - Prob. 19RP Ch. 3 - Prob. 20RP Ch. 3 - Prob. 21RP Ch. 3 - Prob. 22RP Ch. 3 - Prob. 23RP Ch. 3 - Prob. 24RP Ch. 3 - Prob. 25RP Ch. 3 - Prob. 26RP Ch. 3 - Prob. 27RP Ch. 3 - Prob. 28RP Ch. 3 - Prob. 29RP Ch. 3 - Prob. 30RP Ch. 3 - Prob. 31RP Ch. 3 - Prob. 32RP Ch. 3 - Prob. 33RP Ch. 3 - Prob. 34RP Ch. 3 - Prob. 35RP Ch. 3 - Prob. 36RP Ch. 3 - Prob. 37RP Ch. 3 - Prob. 38RP Ch. 3 - Prob. 39RP Ch. 3 - Prob. 40RP Ch. 3 - Prob. 41RP Ch. 3 - Prob. 42RP Ch. 3 - Prob. 43RP Ch. 3 - Prob. 44RP Ch. 3 - Prob. 45RP Ch. 3 - Prob. 46RP Ch. 3 - Prob. 47RP Ch. 3 - Prob. 48RP Ch. 3 - Prob. 49RP Ch. 3 - Prob. 50RP Ch. 3 - Prob. 51RP Ch. 3 - Prob. 52RP Ch. 3 - Prob. 53RP Ch. 3 - Prob. 54RP Ch. 3 - Prob. 56RP Ch. 3 - Prob. 57RP Ch. 3 - Prob. 58RP Ch. 3 - Prob. 59RP Ch. 3 - Prob. 60RP Ch. 3 - Prob. 61RP Ch. 3 - Prob. 62RP Ch. 3 - Prob. 63RP

Knowledge Booster

Background pattern image

Similar questions

Sprocket manufacturing. The manager of this production firm is faced with a potential problem: shortages in the supply of a vital gear sprocket. He is considering the development of an in-house capability to make the sprockets, knowing that the firm needs 35,000 such sprockets each year. If the firm elects to make the sprockets internally, then it must select one of the three possible production processes. Each has different costs, as shown in Table 10.17. Adopting a manual process may lead to union problems. The manager estimates the probability of these problems as 25%, and knows that if they do occur, then the variable cost will increase by $0.50 per sprocket. Further, if the semi-automatic or fully automatic option is selected, then additional training of personnel will be required. The amount and therefore the cost of training are uncertain. For the semi-automatic process, the fixed cost of basic training will add $15,000. However, there is a 20% chance the workers will need extra…
Tri-County Utilities, Inc., supplies natural gas to customers in a three-county area. The company purchases natural gas from two companies: Southern Gas and Northwest Gas. Demand forecasts for the coming winter season are Hamilton County, 400 units; Butler County, 200 units; and Clermont County, 300 units. Contracts to provide the following quantities have been written: Southern Gas, 500 units; and Northwest Gas, 300 units. Distribution costs for the counties vary, depending upon the location of the suppliers. The distribution costs per unit (in thousands of :dollars) are as follows By using Vogel's approximation method, .find the basic starting solution Hamilton Butler Clermont From To Southern Gas 15 Northwest Gas 18 12 20 15
amyo Manufacturing produces four parts that require the use of a lathe and a drillpress. The two machines operate 10 hours a day. The following table provides the time inminutes required by each part:It is desired to balance the two machines by limiting thedifference between their total operation times to at most 30 minutes. The market demand for each part is at least 10 units. Additionally, the number of units of part 1 may not exceed that of part 2. b)Solve the following problems by B&B:Maximize ?=18?1+14?2+8?3+4?4subject to15?1+12?2+7?3+4?4+?5≤37?1,?2,?3,?4,?5=(0,1) Part 6

Recommended textbooks for you

Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole

Text book image

Operations Research : Applications and Algorithms

Computer Science

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Brooks Cole

SEE MORE TEXTBOOKS