Haizen has to arrange transport for N employees where N can be 1 to 500. There are three types of vehicles available with different capacity and different cost. He wants a formula for the lowest cost combination of vehicles for any number N passengers.
This long episode walks through exploring a brute-force method, then moving to Solver, then using VBA with Solver to solve for all 476 non-trivial cases.
Since the video is fairly long, jump to any part of the video:
Table of Contents
(0:00) Welcome to Use Solver with VBA in Excel
(0:15) Defining the Problem - Transport N employees using lowest cost combination of cars, vans, and bus
(0:50) Filling numbers from 1 to 500 using Fill Series Dialog
(1:38) Using formulas to figure out total...