Maths and Physics Tuition/Tests/Notes

  • Skip to content
  • Jump to main navigation and login
  • Jump to additional information

Nav view search

Navigation

  • Testimonials
  • Advice
  • Rates & FAQS
  • Maths/Physics Notes
  • Our Blog
  • Contact Us
  • Online Tests
  • 10 Lesson Offers

Search

Call Us 07766496223
Home A Level Maths Notes D2
  • Home
  • GCSE Maths Notes
  • GCSE Physics Notes
  • IGCSE Maths Notes
  • IGCSE Physics Notes
  • O Level Maths Notes
  • O Level Additional Maths
  • O Level Physics Notes
  • IB Maths Notes
  • IB Physics Notes
  • A Level Maths Notes
    • C1
    • C2
    • C3
    • C4
    • D1
    • D2
    • FP1
    • FP2
    • FP3
    • FP4
    • FP5
    • M1
    • M2
    • M3
    • M4
    • M5
    • S1
    • S2
    • S3
    • S4
    • S6
    • Statistical/Reference Tables
  • A Level Physics Notes
  • University Maths Notes
  • University Physics Notes
  • Tools and Resources
  • Maths Tuition
  • Physics Tuition
  • Tutor Profiles
  • Tuition Enquiry
  • Tutor Registration
  • Open University
  • Newsletter
  • My Favourite Education Links
  • Privacy Policy
  • About Us

Latest Forum Posts

  • riddor stands for
  • Re: Accounting homewok help

Latest D2 Maths Notes

  • Minimum Cell Method
  • Competing Costume Companies and Saddle Points
  • Zero Sum Games
  • Vertex Testing For The Best Solution
  • Using the Stepping Stone Method to Find an Improved Solution to the Transportation Problem
feed-image Subscribe to Category Feed
facebooktwitter





Latest Videos

Feed not found.

Log In or Register to Comment Without Captcha

  • Forgot your password?
  • Forgot your username?
  • Create an account

D2

Filter
Display # 
Title
The Transportation Problem - Shadow Costs
The Transportation Problem - The North West Corner Method
The Transportation Problem - Using Shadow Costs to Find an Improved Solution to the North West Corner Solution
The Travelling Salesman Problem
The Travelling Salesman Problem - Finding a Lower Bound
The Travelling Salesman Problem – Finding an Upper Bound
The Travelling Salesman Problem – Finding an Upper Bound Using the Nearest Neighbour Algorithm
The Unbalanced Transportation Problem
Using the Hungarian Algorithm to Find an Allocation That Maximises Profit
Using The Hungarian Algorithm to Find the Least Cost Allocation

Page 4 of 5

  • Start
  • Prev
  • 1
  • 2
  • 3
  • 4
  • 5
  • Next
  • End
Close info

Additional information

Understand? Take a Test.

Latest Blog Posts

30 March 2023

  • Leg Still Broken
  • My deformed knee
FacebookTwitterDiggStumbleuponGoogle BookmarksLinkedin

skype me