Purchase Solution

Constraints for minimization

Not what you're looking for?

Ask Custom Question

The famous Y.S. Chang Restaurant is open 24 hours a day. Waiters and busboys report for duty at 3am, 7am, 11am, 3pm, 7pm or 11pm and each works an 8-hour shift. The following table shows the minimum number of workers needed during the six periods into which the day is divided. The scheduling problem is to determine how many waiters and busboys should report for work at the start of each time period to minimize the total staff required for one day's operation.

Period Time # of waiters/busboys required
1 3am-7am 3
2 7am-11am 12
3 11am-3pm 16
4 3pm-7pm 9
5 7pm-11pm 11
6 11pm-3am 4

Purchase this Solution
Solution Summary

This shows how to schedule staff to minimize total number required.

Purchase this Solution
Free BrainMass Quizzes
Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

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

Multiplying Complex Numbers

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

Solving quadratic inequalities

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

View More Free Quizzes
Related BrainMass Solutions

  • Linear programming problem: Minimization

    This solution provides details on how to solve a minimization problem for a linear programming situation.

  • Linear Programming Minimization Problem

    Look for binding constraint in "Binding" tab of the spreadsheet. This solution provides details on solving a linear programming minimization problem and identifies the binding constraints.

  • Slack, Surplus, and Artificial Variables

    Minimization problems requires one to minimize the objective function subject to the given inequality constraints.

  • Linear Programming Problems Requirements and Steps

    Formulate the objective function and constraints. 4. Graph the constraints, and always solve for the coordinates at the point of intersection of lines. 5.

  • Linear programming, True false and Fill in the blanks

    Consider the following minimization problem. Min z = x1 + 2x2 s.t. x1 + x2 300 2x1 + x2 400 2x1 + 5x2 750 x1, x2 0 Which constraints are binding at the optimal solution? (x1 = 250, x2 = 50) 17.

  • Definitions of the Linear Programming Formulation Variables

    For example, for a minimization problem: 4x1 + 2x2 + 6x3 11 For a maximization problem: 12x1 + x2 + 7x3 10 Linear Programming Formulation Variables are defined.

  • Linear Programming

    Consider the following minimization problem. Min z = x1 + 2x2 s.t. x1 + x2 300 2x1 + x2 400 2x1 + 5x2 750 x1, x2 0 Which constraints are satisfied at the optimal solution (x1 = 250, x2 = 50)? 9.

  • Linear Programming: Inequalities

    Answer True False Question 3 In minimization LP problems the feasible region is always below the resource constraints.

  • Hungarian method and EOQ.

    . --> Hungarian method is applicable for minimization problem. Assignment problem having maximization as objective function can be easily converted into a minimization problem and then solved using Hungarian method.

  • Quantitative Methods - Minimization problem

    104233 Quantitative Methods - Minimization problem For the constraints given below, which point is in the feasible region of this minimization problem?

View More Related Solutions