Purchase Solution

# Linear Programming Model: Example Problem

Not what you're looking for?

A company wants to offer their employees a three-day training program on team building and a two-day program on problem solving. They have requested at least 8 training sessions on team building and at least 10 training sessions on problem solving. Furthermore, the total number of training sessions offered must be 25.

The training consultant has 84 days of training time available.

Each training session on team building costs \$10,000 and each training session on problem solving costs \$8,000.

Formulate a Linear Programming Model that can be used to determine the number of training sessions on team building and the number of training sessions on problem solving that should be offered in order to minimize total cost.

Identify the variables, formulate the objective function, determine all the constraints as linear inequalities, clearly identify the critical region, solve the coordinates of the corner points of the critical region and identify which corner points minimize the objective function.

##### Solution Summary

This solution provides assistance formulating a linear programming model.

##### Solution Preview

Hi there,

Here is my answer:

Suppose there are x training sessions on team building and y training sessions on problem ...

##### Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

##### Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

##### Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

##### Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

##### Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.