MATHEMATICS IN THE MODERN WORLD
QUIZ # 1 Reviewer
LESSON 1 ● Explicit Constraints
Definition of Terms: - availability of resources
● Linear Programming ● Implicit Constraints
- quantitative technique/tool used - variables that has values ≥ 0
for optimal allocation of limited - conditions to solve objective
resources functions
- can be more than one solution
● Divisibility Assumption
● Linear Program - made for linear mathematical
- mathematical translation to modeling in linear programming
problems
● Non-intergral Values
● Objective of Linear - decimals/ fractions
Programming
- to maximize/minimize optimal ● Graphical Method
solution - used to solve linear program with
2 decision variables ONLY
● Optimal Solution
- satisfies the objective function ● Simplex Method
- solution that maximizes or - used to solve linear program with
minimizes MANY decision variables
- set of linear function and linear
inequalities ● George B. Dantzig
- developed Simplex Method
● Mathematical Model - German Mathematician
- translates the real-life problems -
into a set of equations,
inequalities and functions Enumeration:
●
4 Types of Programming
● Linear Inequality
- contains inequality sign (> , < ) 1. Goal Programming
2. Integer Programming
● Objective Function 3. Dynamic Programming
- specifies the goal that either to 4. Non-integer Programming
minimize and maximize
3 Components of Linear Programming
, 1. Objective Function 1. Graphical Method
2. Explicit Constraints 2. Simplex Method
3. Implicit Constraints
2 Linear Programming Methods
2 Mathematicians mentioned in the lesson
1. Rene Descartes – French mathematician contributed the Cartesian Plane
2. George B. Dantzig – German mathematician developed Simplex Method
Parts of Linear Program:
QUIZ # 1 Reviewer
LESSON 1 ● Explicit Constraints
Definition of Terms: - availability of resources
● Linear Programming ● Implicit Constraints
- quantitative technique/tool used - variables that has values ≥ 0
for optimal allocation of limited - conditions to solve objective
resources functions
- can be more than one solution
● Divisibility Assumption
● Linear Program - made for linear mathematical
- mathematical translation to modeling in linear programming
problems
● Non-intergral Values
● Objective of Linear - decimals/ fractions
Programming
- to maximize/minimize optimal ● Graphical Method
solution - used to solve linear program with
2 decision variables ONLY
● Optimal Solution
- satisfies the objective function ● Simplex Method
- solution that maximizes or - used to solve linear program with
minimizes MANY decision variables
- set of linear function and linear
inequalities ● George B. Dantzig
- developed Simplex Method
● Mathematical Model - German Mathematician
- translates the real-life problems -
into a set of equations,
inequalities and functions Enumeration:
●
4 Types of Programming
● Linear Inequality
- contains inequality sign (> , < ) 1. Goal Programming
2. Integer Programming
● Objective Function 3. Dynamic Programming
- specifies the goal that either to 4. Non-integer Programming
minimize and maximize
3 Components of Linear Programming
, 1. Objective Function 1. Graphical Method
2. Explicit Constraints 2. Simplex Method
3. Implicit Constraints
2 Linear Programming Methods
2 Mathematicians mentioned in the lesson
1. Rene Descartes – French mathematician contributed the Cartesian Plane
2. George B. Dantzig – German mathematician developed Simplex Method
Parts of Linear Program:
