Linear Programming

Mathematics · Chapter 16 · Unit 6: Linear Programming

Not started Not started

Your path through this chapter

1
Visual lesson Beta
1. Part 1: Terms, models and feasible regions19 slides
2. Part 2: Optimal solutions by the corner point method17 slides
Step 1: Not started
Notes Beta
6 sections with key terms, formulas and exam tips.
Read the notes Step 2: Not started
Flashcards Beta
30 cards for quick recall of key terms and facts.
Review the cards Step 3: Not started
Practice
68 board-style questions with instant checks: Multiple choice 24, Short answer 19, Assertion and reason 6, Long answer 6.
Practise Step 4: Not started
5
Chapter test Free
Short and long chapter tests in board pattern, with results and analysis.
- Chapter test (long) — Linear Programming · 40 marks · 100 min
- Chapter test (short) — Linear Programming · 20 marks · 50 min
Step 5: Not started

Terminology: constraints, objective function, optimisation; advantages, limitations and application areas; types of LP problems
Mathematical formulation of LP problems (manufacturing, diet, transportation-type)
Graphical method: feasible and infeasible regions, bounded and unbounded regions (up to three non-trivial constraints)
Feasible, infeasible and optimal feasible solutions; corner point method; cases where no optimum exists