## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

4.1 Problem Set

101

MAXIMIZATION BY THE SIMPLEX METHOD Solve the following linear programming problems using the simplex method. 1) Maximize subject to z = x1 + 2x2 + 3x3 x1 + x2 + x3 2x1 + x2 + 3x3 x1, x2, x3 12 18 0

2) Maximize subject to

z = x1 + 2x2 + x3 x1 + x2 x2 + x3 x1 + x3 x1, x2, x3 3 4 5 0

3) A farmer has 100 acres of land on which she plans to grow wheat and corn. Each acre of wheat requires 4 hours of labor and $20 of capital, and each acre of corn requires 16 hours of labor and $40 of capital. The farmer has at most 800 hours of labor and $2400 of capital available. If the profit from an acre of wheat is $80 and from an acre of corn is $100, how many acres of each crop should she plant to maximize her profit?

and a bookcase requires 3 hours of cutting. and the third at most 300 hours. If the profit is $20 per unit for a chair. the company has altogether 2800 Pippin. At the end of the season.1 Problem Set Name:_________________________________ 4) A factory manufactures chairs. a table needs 1 hour of cutting. The first operation can be used at most 600 hours.102 4. 1 hour of assembly. tables and bookcases each requiring the use of three operations: Cutting. 8 Macintosh and 4 Fuji apples. Assembly. Box I contains 4 apples of each kind. and 3 Fuji. Determine the maximum number of boxes that the company can make. and $25 for a bookcase. . 1 hour of assembly. 3 Macintosh. 2 hours of assembly. and Fuji apples in mixes. A chair requires 1 hour of cutting. The Acme Apple company sells its Pippin. Box II contains 6 Pippin. 2200 Macintosh. and 1 hour of finishing. and Finishing. and 2300 Fuji apples left. and Box III contains no Pippin. and 1 hour of finishing. how many units of each should be manufactured to maximize profit? 5). and 1 hour of finishing. $30 for a table. the second at most 500 hours. Macintosh.

x2.Name:_________________________________ 4.1 Problem Set 103 MINIMIZATION BY THE SIMPLEX METHOD In problems 1-2. the dual. x3 10 12 0 . and then solve by the simplex method. 1) Minimize subject to z = 6x1 + 8x2 2x1 + 3x2 4x1 + 5x2 7 9 x1. x2 0 2) Minimize subject to z = 5x1 + 6x2 + 7x3 3x1 + 2x2 + 3x3 4x1 + 3x2 + 5x3 x1. convert each minimization problem into a maximization problem.

and 10 calories. Food A. 1 unit of minerals. 9 units of minerals. 3) Minimize subject to z = 4x1 + 3x2 x1 + x2 3x1 + 2x2 10 24 x1. Each unit of Food C provides 2 units of vitamins. and 2 calories. and then solve by the simplex method. convert each minimization problem into a maximization problem. how many units of each food should be purchased to keep costs at a minimum? . Each unit of Food A provides 1 unit of vitamins. Three foods. If Food A costs $3 per unit. x2 0 4) A diet is to contain at least 8 units of vitamins. 1 unit of minerals. and 1 calorie. and 2 calories. Each unit of Food B provides 2 units of vitamins. and Food C are to be purchased.104 4. Food B. 1 unit of minerals. the dual. Food B costs $2 per unit and Food C costs $3 per unit.1 Problem Set Name:_________________________________ In problems 3-4.

x2 ≥ 0 2) Maximize z = 5x1 + 8x2 subject to x1 + 2x2 3x1 + x2 30 30 x1 ≥ 0.1 Problem Set 105 CHAPTER REVIEW Solve the following linear programming problems using the simplex method.Name:_________________________________ 4. x3 1800 2000 3200 0 6) Minimize z = 12x1 + 10x2 subject to x1 + x2 2x1 + x2 6 8 x1 ≥ 0. x2. x3 4) Maximize z = x1 + 6x2 + 8x3 subject to x1 + 2x2 2x2 + x3 4x1 + x3 x1. x2 ≥ 0 7) Minimize z = 4x1 + 6x2 + 7x3 subject to x1 + x2 + 2x3 20 . x2. x3 5) 1200 1800 3600 0 32 28 0 Maximize z = 6x1 + 8x2 + 5x3 subject to 4x1 + x2 + x3 2x1 + 2x2 + x3 4x1 + 2x2 + x3 x1. 1) Maximize z = 5x1 + 3x2 subject to x1 + x2 2x1 + x2 12 16 x1 ≥ 0. x2 ≥ 0 3) Maximize z = 2x1 + 3x2 + x3 subject to 4x1 + 2x2 + 5x3 2x1 + 4x2 + 3x3 x1. x2.

and Dr. and 60 minutes for preparation. respectively. respectively. x2. medium. on a recall type 6. respectively. The three types. require the students to spend.1 Problem Set Name:_________________________________ x1 + 2x2 + x3 x1. Factory I and Factory II. B. If the profit made from each of these types is $40. Wright would like the students to score at least 130 . Machine I and Machine II. The small. B. and 4 sales hours of labor. 2. and what is the maximum profit? 11) A company produces three products. objective. Professor Wright gives three types of quizzes.106 4. he has decided to give at least 20 quizzes next quarter. A. A Machine I Machine II Profit 1 2 20 B 2 2 30 C 2 4 40 How many units of each product should be manufactured to maximize profit. x3 8) 30 0 Minimize z = 40x1 + 48x2 + 30x3 subject to 2x1 + 2x2 + x3 x1 + 3x2 + 2x3 x1. and on a recall-plus 7. Daily production of each factory for each product is listed below. and a maximum of 1. Each product requires the use of two machines. To keep his students on their toes. and large. at its two factories. The time requirements and profit per unit for each product are listed below. $80. and C. If the cost of operating Factory I is $4. and Professor Wright would like them to spend at least 12 hours(720 minutes) preparing for these quizzes above and beyond the normal study time. The total hours available. on Machine I and Machine II per month are 180 and 300. respectively. and a maximum of 600 hours of labor is available. A. and 700 units of C. objective. recall. x2. medium. 3. 2. 10 minutes. 30 minutes. x3 25 30 0 9) A department store sells three different types of televisions: small. and large televisions require. and recall-plus. take up. An average score on an objective quiz is 5. how many days should each factory operate to complete the order at a minimum cost. and 6 cubic feet of storage space.000 per day and the cost of operating Factory II is $5000. how many of each type of television should be sold to maximize profit. and what is the minimum cost? 12) For his classes. and $100. respectively. The store can sell up to 200 sets a month. recall. medium.020 cubic feet of storage space is available. The three types. and recall-plus quizzes. small. Factory I Product A Product B Product C 10 20 20 Factory II 20 20 10 The company must produce at least 1000 units of product A. 1600 units of B. 6. and C. and large. and what is the maximum profit? 10) A factory manufactures three products.

Name:_________________________________ 4.1 Problem Set 107 points on all quizzes. It takes the professor one minute to grade an objective quiz. and 3 minutes to grade a recall-plus quiz. How many of each type should he give in order to minimize his grading time? . 2 minutes to grade a recall type quiz.

- Test 2 (2).pdf
- 12 Transportation Model LP
- pg
- The_News_Leader_20160418_A03_1
- OR_MJ07
- agriwatch
- Global Crop Production Review 2011
- industrialization ch25 sec2 website
- Cement Manufacturing Plant Project Report
- Commodities - Grain and Feed Annual
- MS Case 2
- Linear Programming Data Formulation
- 21
- Teaching Factory
- rev_stls_19240930
- Linear Programming Problems en 29-5-2012
- Interior Point Methods Example
- Assignment 1 - Math
- Ok Lpmulti
- A New MCDM Method Based on GRA in Interval Valued tic Fuzzy Setting
- Chemical Engineering Optimization
- Blood o Chart
- course outline-spring- 2016
- [Journal of Electrical Engineering] Optimal Relays Coordination Efficient Method in Interconnected Power Systems
- Grain
- 119.pdf
- Implementation of Neural Network Model for Solving Linear Programming Problem
- b 04110710
- Galaxy 1957 09 Text
- ies bolivia articles

Skip carousel

- Cost of Goods Manufactured Schedule
- Factory Street Project Update March 25, 2016
- Textiles - European Textiles
- Oct. 16 Factory Street Reconstruction Update
- Isah makes it with TOPdesk and TFS
- 53238_1940-1944
- 60567_1950-1954
- Mill River Economic Development
- Women's Wild OatsEssays on the Re-fixing of Moral Standards by Hartley, C. Gasquoine (Catherine Gasquoine), 1867-1928
- 69253_2005-2009
- rev_frbclev_19350228
- Rev Frbatl 196001
- Fostering Women's Empowerment Through Special Economic Zones - Bangladesh
- 53634_1930-1934
- The Mirror of Literature, Amusement, and Instruction Volume 13, No. 365, April 11, 1829 by Various
- United States v. Cardiff, 344 U.S. 174 (1952)
- rev_stls_19360330
- 60564_1950-1954
- 45767_1925-1929
- 65145_1955-1959
- 13283_1985-1989
- 64101_1955-1959
- History
- 68069_1960-1964
- 68064_1955-1959
- rev_stls_19360131

Skip carousel

- UT Dallas Syllabus for opre6302.001.07f taught by Kathryn Stecke (kes021000)
- Quantitative Management for Analysis
- ON Fuzzy Linear Programming Technique Application
- UT Dallas Syllabus for opre6302.001.08f taught by Kathryn Stecke (kes021000)
- 65726_1970-1974
- UT Dallas Syllabus for opre6302.mbc 06s taught by Metin Cakanyildirim (metin)
- UT Dallas Syllabus for opre6302.001.09f taught by Kathryn Stecke (kes021000)
- A New Method for Solving Deterministic Multi-Item Fuzzy Inventory Model with Three Constraints
- UT Dallas Syllabus for opre6302.001.10f taught by Kathryn Stecke (kes021000)
- Optimization

Sign up to vote on this title

UsefulNot usefulRead Free for 30 Days

Cancel anytime.

Close Dialog## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Close Dialog## This title now requires a credit

Use one of your book credits to continue reading from where you left off, or restart the preview.

Loading