• If you are citizen of an European Union member nation, you may not use this service unless you are at least 16 years old.


Linear Programming - Example 2

Page history last edited by LFS 11 years, 8 months ago

Home > Do Mathematics -> Linear Programming - Example 2

Linear Programming with GeoGebra - Example 2

 Example 1 Example 3  

Problem*: Ernesto is about to take a history test consisting of matching questions worth 10 points each and essay questions worth 25 points each. He is required to do at least 3 matching questions, but there are only 12 matching questions. Similarily, he must do at least 4 essays, but there are only 15 essay questions. Ernesto's teacher will grade at most a total of 20 questions. How many of each type should he answer to maximum his score? What is this maximum possible score?



The Problem asks how many questions of each type so we let these be our variables:

  • Let x=number of matching questions and let y=number of essay questions.
  • Reading we see that we have the 4 constraints:  3 ≤ x ≤12 and 4 ≤ y ≤15.
  • From the problem we get our 5th constraint: x+y 20
  • Finally, our objective function which we need to maximize is pointsP=10x+25y.

Let's solve this problem using GeoGebra!  Watch the mathcast, study the interactivity below and then do it yourself.

YouTube Mathcast


InterActivity with GeoGebra


Sorry, the GeoGebra Applet could not be started. Please make sure that Java 1.4.2 (or later) is installed and active in your browser (Click here to install Java now)

*Problem adapted from: http://answers.yahoo.com/question/index?qid=20071025144630AAgIqoW

Get GeoGebra  

Site Meter



Comments (0)

You don't have permission to comment on this page.