Purchase Solution

Solving a Word Problem Subject to Constraints

Not what you're looking for?

Ask Custom Question

Joe has to take a test which consists of short-answer questions worth 9 points each and essay questions worth 25 points each. He must do at least 9 short-answer questions, but won't have time to do more than 10. He has to answer at least 3 essay questions, but can't spend time to do more than 10. If no more than 19 questions can be done, what is his maximum score?

Purchase this Solution
Solution Summary

A word problem is solved subject to constraints. The maximum scores are determined.

Solution Preview

Hi, here is the solution,

Let x be the number short-answer questions and y be the number of essay ...

Purchase this Solution
Free BrainMass Quizzes
Multiplying Complex Numbers

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

Graphs and Functions

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

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.

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.

View More Free Quizzes
Related BrainMass Solutions

  • Linear Programming : Finding Constraints and Solving Word Problems

    58338 Linear Programming: Finding Constraints and Solving Word Problem Stan and Ron's hobby is building birdhouses. The number of wren houses cannot exceed 2 times the number of martin houses.

  • System of Equations & Linear Programming: Subject to Constraints

    System of Equations and Linear Programming and Solving Subject to Constraints are investigated. The solution is detailed and well presented.

  • Linear programming, True false and Fill in the blanks

    A graphical solution is limited to solving linear programming problems with only ___ decision variables 13. The optimal solution to a linear programming model always occurs at a (an) _________ point of the feasible region. 14.

  • Slack and surplus variables

    Given the following linear programming problem Maximize 20x + 15y Subject to 2x + 2y <100 2x + 3y < 120 x> 10 x, y > 0 (a) Graph the constraints.

  • Linear Programming : Solving by a Graphical Method

    I think your question is Maximum Z= 9x + 25 y Subject to the constraints, x+y<=19, 10>=x>=9, 10>= y >= 3 This is a linear program, so the maximum occurs at the vertex of the feasible region.

  • Using the Simplex Method

    122940 Using the Simplex Method Consider the following maximum problem in standard form: Maximize Z = 8X1 + 2X2 + 3X3 Subject to the constraints X1 + 3X2 + 2X3 < 10 4X1 + 2X2 + 3X3 < 8 X1 > 0, X2 > 0, X3 > 0 (a) Rewrite the two

  • Major Bill Bligh - Army War College

    hours, class and studying X4 = 20 hours, social time This solution helps Major Bill Bligh to figure out a better time management plan for his officers by formulating a goal programming problem and solving it.

  • Feasibility of a Linear Programming Problem

    52640 Feasibility of a Linear Programming Problem Exercise 3.22 Consider the following linear programming problem with a single constraint: minimize Σ i=1 --> n cixi subject to = ... i=1,...,n.

  • Quantitative Methods: INTEGER PROGRAMMING

    If we are solving a 0-1 integer programming problem, the constraint x1 ≤ x2¬ is a ________________constraint. 14. If we are solving a 0-1 integer programming problem, the constraint x1 = x2¬ is a ________________constraint. 15.

View More Related Solutions