Packing problems are very common and popular but typical solution procedures involve computation of numerous feasible solutions even for a small scale problem. These types of problems are commonly categorized as knapsack problem or bin packing problems and many of them are NP complete. An efficient mechanism for finding an exact solution for a two phase packing problem is proposed. The mechanism reduces the number of feasible solutions considered by conducting a naïve search for a pseudo efficient frontier of solutions for the first phase. Furthermore, by conduction the first phase in such a way, evaluating the second phase is made more efficient. An algorithm for the two dimensional case is presented along with proofs of correctness and complexity.