Toy World (Mauritius) produces two types of toy model trains, the Steamer train and the Lightning train. Three machines are required to produce each type; these machines are classified as X, Y, and Z. Each Steamer train requires 7 minutes of process time on machine X, 4 minutes on machine y, and 10 minutes on machine Z. The lightning train requires 4 minutes on X, 15 minutes on Y, and 16 minutes on Z. Each day there are 420 minutes available on machine X, 600 minutes on machine Y, and 840 minutes on machine Z. The profit for the Steamer train is $8 per unit and that of the Lightning train is $10 per unit. Formulate the complete linear programming model for company’s model trains so as to maximize its profit. Define the decision variables, constraints and objective function clearly. [1] Plot each constraint lines for this linear programming problem on a graph paper. Indicate the feasible region, R clearly on your [1] Solve the linear programming problem to find out the optimal number of Steamer trains and Lightning trains that are required to maximize profit, stating clearly the maximum profit that can be [1] Do any constraints have (nonzero) slack or surplus? If yes, which one(s) and how much slack or surplus does each have? [1] Are any constraints redundant? If yes, which one(s)? Explain [1]
Toy World (Mauritius) produces two types of toy model trains, the Steamer train and the Lightning train. Three machines are required to produce each type; these machines are classified as X, Y, and Z. Each Steamer train requires 7 minutes of process time on machine X, 4 minutes on machine y, and 10 minutes on machine Z. The lightning train requires 4 minutes on X, 15 minutes on Y, and 16 minutes on Z. Each day there are 420 minutes available on machine X, 600 minutes on machine Y, and 840 minutes on machine Z. The profit for the Steamer train is $8 per unit and that of the Lightning train is $10 per unit. Formulate the complete linear programming model for company’s model trains so as to maximize its profit. Define the decision variables, constraints and objective function clearly. [1] Plot each constraint lines for this linear programming problem on a graph paper. Indicate the feasible region, R clearly on your [1] Solve the linear programming problem to find out the optimal number of Steamer trains and Lightning trains that are required to maximize profit, stating clearly the maximum profit that can be [1] Do any constraints have (nonzero) slack or surplus? If yes, which one(s) and how much slack or surplus does each have? [1] Are any constraints redundant? If yes, which one(s)? Explain [1]
Chapter1: Financial Statements And Business Decisions
Section: Chapter Questions
Problem 1Q
Related questions
Question
Toy World (Mauritius) produces two types of toy model trains, the Steamer train and the Lightning train. Three machines are required to produce each type; these machines are classified as X, Y, and Z. Each Steamer train requires 7 minutes of process time on machine X, 4 minutes on machine y, and 10 minutes on machine Z. The lightning train requires 4 minutes on X, 15 minutes on Y, and 16 minutes on Z. Each day there are 420 minutes available on machine X, 600 minutes on machine Y, and 840 minutes on machine Z. The profit for the Steamer train is $8 per unit and that of the Lightning train is $10 per unit.
- Formulate the complete linear programming model for company’s model trains so as to maximize its profit. Define the decision variables, constraints and objective function clearly. [1]
- Plot each constraint lines for this linear programming problem on a graph paper. Indicate the feasible region, R clearly on your [1]
- Solve the linear programming problem to find out the optimal number of Steamer trains and Lightning trains that are required to maximize profit, stating clearly the maximum profit that can be [1]
- Do any constraints have (nonzero) slack or surplus? If yes, which one(s) and how much slack or surplus does each have? [1]
- Are any constraints redundant? If yes, which one(s)? Explain [1]
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 4 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, accounting and related others by exploring similar questions and additional content below.Recommended textbooks for you
Accounting
Accounting
ISBN:
9781337272094
Author:
WARREN, Carl S., Reeve, James M., Duchac, Jonathan E.
Publisher:
Cengage Learning,
Accounting Information Systems
Accounting
ISBN:
9781337619202
Author:
Hall, James A.
Publisher:
Cengage Learning,
Accounting
Accounting
ISBN:
9781337272094
Author:
WARREN, Carl S., Reeve, James M., Duchac, Jonathan E.
Publisher:
Cengage Learning,
Accounting Information Systems
Accounting
ISBN:
9781337619202
Author:
Hall, James A.
Publisher:
Cengage Learning,
Horngren's Cost Accounting: A Managerial Emphasis…
Accounting
ISBN:
9780134475585
Author:
Srikant M. Datar, Madhav V. Rajan
Publisher:
PEARSON
Intermediate Accounting
Accounting
ISBN:
9781259722660
Author:
J. David Spiceland, Mark W. Nelson, Wayne M Thomas
Publisher:
McGraw-Hill Education
Financial and Managerial Accounting
Accounting
ISBN:
9781259726705
Author:
John J Wild, Ken W. Shaw, Barbara Chiappetta Fundamental Accounting Principles
Publisher:
McGraw-Hill Education