Homework Help is Here – Start Your Trial Now!
Business
Operations Management
1. Maximize Z = 2X1 + X2       Subject to:                               X2 < 10                              2X1 + 5X2 < 60                              X1 + X2 <18                            3X1 + X2 < 44   2. Maximize Z = 2X1 + X2 +3X3        Subject X1 + X2 + 2X3 < 400

1. Maximize Z = 2X1 + X2       Subject to:                               X2 < 10                              2X1 + 5X2 < 60                              X1 + X2 <18                            3X1 + X2 < 44   2. Maximize Z = 2X1 + X2 +3X3        Subject X1 + X2 + 2X3 < 400

Practical Management Science
Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter2: Introduction To Spreadsheet Modeling
Section: Chapter Questions
Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...
See similar textbooks
icon
Related questions
Question

Instruction: Formulate the dual problems for X2 the following linear programming model No need to compute/doing a tableau

 

1. Maximize Z = 2X1 + X2

 

    Subject to:

 

                            X2 < 10

 

                           2X1 + 5X2 < 60

 

                           X1 + X2 <18

 

                         3X1 + X2 < 44

 

2. Maximize Z = 2X1 + X2 +3X3

 

     Subject X1 + X2 + 2X3 < 400

 

                           2X1 + X2 + X3 < 500

 

3. Maximize Z = 80X1 + 60X2

 

    Subject X1 + X2 = 200

 

                          X1 < 50 

 

                         X2 > 80

Instruction: Formulate the dual problems for X2 the following linear programming model No need to compute/doing a tableau 1. Maximize Z = 2X1 + X2 Subject to: X2< 10 2X1 + 5X2 < 60 X1 + X2 <18 3X1 + X2 < 44 2. Maximize Z = 2X1 + X2 +3X3 Subject X1 + X2 + 2X3 < 400 2X1 + X2 + X3 < 500 3. Maximize Z = 80X1 + 60X2 Subject X1+ X2 = 200 X1< 50 X2 > 80
Transcribed Image Text:Instruction: Formulate the dual problems for X2 the following linear programming model No need to compute/doing a tableau 1. Maximize Z = 2X1 + X2 Subject to: X2< 10 2X1 + 5X2 < 60 X1 + X2 <18 3X1 + X2 < 44 2. Maximize Z = 2X1 + X2 +3X3 Subject X1 + X2 + 2X3 < 400 2X1 + X2 + X3 < 500 3. Maximize Z = 80X1 + 60X2 Subject X1+ X2 = 200 X1< 50 X2 > 80
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Similar questions
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,
Operations Management
Operations Management
Operations Management
ISBN:
9781259667473
Author:
William J Stevenson
Publisher:
McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi…
Operations and Supply Chain Management (Mcgraw-hi…
Operations Management
ISBN:
9781259666100
Author:
F. Robert Jacobs, Richard B Chase
Publisher:
McGraw-Hill Education
Business in Action
Business in Action
Operations Management
ISBN:
9780135198100
Author:
BOVEE
Publisher:
PEARSON CO
Purchasing and Supply Chain Management
Purchasing and Supply Chain Management
Operations Management
ISBN:
9781285869681
Author:
Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Publisher:
Cengage Learning
Production and Operations Analysis, Seventh Editi…
Production and Operations Analysis, Seventh Editi…
Operations Management
ISBN:
9781478623069
Author:
Steven Nahmias, Tava Lennon Olsen
Publisher:
Waveland Press, Inc.
SEE MORE TEXTBOOKS