Simplex Method – NBC Institute

QT – May 2019 – L1 – Q7a – Linear Programming

Formulate a linear programming model for maximizing profit using decision variables and constraints.

Question

Joycarpap Ltd manufactures and sells three models of affordable toys: Car, Joy, and Pap. Each model requires a specific amount of fabrication hours, material worth, and assembly hours as shown in the table below:

There are 210 fabrication hours available, 170 hours of assembly available, and materials worth GH¢200 in stock. Market research conducted by the company revealed that demand for the toys is such that, in whatever combination of the three models produced, all of the output can be sold within a week.

Each Car contributes GH¢15 to profit, each Joy contributes GH¢20 to profit, and each Pap contributes GH¢14 to profit. Using $X_{1}$ , $X_{2}$ , $X_{3}$ as decision variables, and $S_{1}$ , $S_{2}$ , $S_{3}$ as slack variables, and $P$ as total profit:

Required:
i) Formulate a linear programming problem. (4 marks)

ii) Set up the initial Simplex Tableau. (4 marks)

iii) Determine the total profit in the first iteration. (5 marks)

Answer

Find Related Questions by Tags, levels, etc.

Tags: Constraints, Decision Variables, Linear Programming, Profit Maximization, Simplex Method
Level: Level 1

Topic: Linear Programming
Series: MAY 2019

QT – Nov 2016 – L1 – Q2 – Linear Programming

This question involves formulating and solving a linear programming problem for maximizing profit in belt production.

Question

JinJin Company Limited makes two types of leather belts: Type Superior and Type Standard. Type Superior is of high quality, and Type Standard is of lower quality. The respective profits are GHp 40 and GHp 30 per belt. The production of each Type Superior requires twice as much time as a Type Standard belt, and if all belts were of Type Standard, the company could make 1,000 belts per day. The supply of leather is sufficient for only 800 belts per day (both types combined). Belt Type Superior requires a fancy buckle, and only 400 of these are available per day. There are only 700 buckles a day available for Type Standard.

Required:
a) Formulate this problem as a Linear Programming Model. (4 marks)

b) Set up the initial Simplex Tableau. (4 marks)

c) Solve your Tableau in (b) above. (8 marks)

d) Interpret your final Simplex Tableau. (4 marks)

Answer

Find Related Questions by Tags, levels, etc.

Tags: Linear Programming, Optimization, Production planning, Simplex Method
Level: Level 1

Topic: Linear Programming
Series: NOV 2016

QT – May 2019 – L1 – Q7a – Linear Programming

Formulate a linear programming model for maximizing profit using decision variables and constraints.

Question

Required:
i) Formulate a linear programming problem. (4 marks)

ii) Set up the initial Simplex Tableau. (4 marks)

iii) Determine the total profit in the first iteration. (5 marks)

Answer

Find Related Questions by Tags, levels, etc.

Tags: Constraints, Decision Variables, Linear Programming, Profit Maximization, Simplex Method
Level: Level 1

Topic: Linear Programming
Series: MAY 2019

QT – Nov 2016 – L1 – Q2 – Linear Programming

This question involves formulating and solving a linear programming problem for maximizing profit in belt production.

Question

Required:
a) Formulate this problem as a Linear Programming Model. (4 marks)

b) Set up the initial Simplex Tableau. (4 marks)

c) Solve your Tableau in (b) above. (8 marks)

d) Interpret your final Simplex Tableau. (4 marks)

Answer

Find Related Questions by Tags, levels, etc.

Tags: Linear Programming, Optimization, Production planning, Simplex Method
Level: Level 1

Topic: Linear Programming
Series: NOV 2016

Question Tag: Simplex Method

Filter by Professional Bodies

Filter by Subject

Filter by Series

Filter by Topics

Filter by Levels

QT – May 2019 – L1 – Q7a – Linear Programming

Formulate a linear programming model for maximizing profit using decision variables and constraints.

QT – Nov 2016 – L1 – Q2 – Linear Programming

This question involves formulating and solving a linear programming problem for maximizing profit in belt production.

QT – May 2019 – L1 – Q7a – Linear Programming

Formulate a linear programming model for maximizing profit using decision variables and constraints.

QT – Nov 2016 – L1 – Q2 – Linear Programming

This question involves formulating and solving a linear programming problem for maximizing profit in belt production.

Our offerings

Contact Info

Customer

Get In Touch

Question Tag: Simplex Method

Filter by Professional Bodies

Filter by Subject

Filter by Series

Filter by Topics

Filter by Levels

QT – May 2019 – L1 – Q7a – Linear Programming

Formulate a linear programming model for maximizing profit using decision variables and constraints.

You're reporting an error for "QT – May 2019 – L1 – Q7a – Linear Programming"

QT – Nov 2016 – L1 – Q2 – Linear Programming

This question involves formulating and solving a linear programming problem for maximizing profit in belt production.

You're reporting an error for "QT – Nov 2016 – L1 – Q2 – Linear Programming"

QT – May 2019 – L1 – Q7a – Linear Programming

Formulate a linear programming model for maximizing profit using decision variables and constraints.

You're reporting an error for "QT – May 2019 – L1 – Q7a – Linear Programming"

QT – Nov 2016 – L1 – Q2 – Linear Programming

This question involves formulating and solving a linear programming problem for maximizing profit in belt production.

You're reporting an error for "QT – Nov 2016 – L1 – Q2 – Linear Programming"

Our offerings

Contact Info

Customer

Get In Touch

admin