# Linear Programming

## Maximize and minimize quantities using linear inequality systems

Levels are CK-12's student achievement levels.
Basic Students matched to this level have a partial mastery of prerequisite knowledge and skills fundamental for proficient work.
At Grade (Proficient) Students matched to this level have demonstrated competency over challenging subject matter, including subject matter knowledge, application of such knowledge to real-world situations, and analytical skills appropriate to subject matter.
Advanced Students matched to this level are ready for material that requires superior performance and mastery.

## Linear Programming

by CK-12 //basic
Solve problems involving systems of linear inequalities.
MEMORY METER
This indicates how strong in your memory this concept is
3
• Video

## Systems of Linear Inequalities

by CK-12 //basic
Goes over systems of linear inequalities: what are they and how to solve them.
MEMORY METER
This indicates how strong in your memory this concept is
0
• Video

## Linear Programming - Overview

by CK-12 //basic
Overview
MEMORY METER
This indicates how strong in your memory this concept is
0
• Video

## Linear Programming - Example 1

by CK-12 //basic
Find the maximum and minimum values of the objective function given a set of constraints
MEMORY METER
This indicates how strong in your memory this concept is
0
• Video

## Linear Programming - Example 2

by CK-12 //basic
Find the minimum or maximum value when the region is unbounded
MEMORY METER
This indicates how strong in your memory this concept is
0
• Video

## Linear Programming - Example 3

by CK-12 //basic
Word Problems - Optimal Profit or Cost
MEMORY METER
This indicates how strong in your memory this concept is
0