H3_Q1:

import com.opencsv.bean.CsvToBeanBuilder; import java.io.FileNotFoundException; import java.io.FileReader; import java.util.LinkedList; import java.util.List; public class H3_Q1 { public static void main(String[] args) throws FileNotFoundException { LinkedList items = new LinkedList(); int c = 11; int d =10; //Uncomment line below once loadProblem method is complete //loadProblem(items); } }

H3_Q2:

import com.opencsv.bean.CsvToBeanBuilder; import java.io.FileNotFoundException; import java.io.FileReader; import java.util.LinkedList; import java.util.List; public class H3_Q2 { public static void main(String[] args) throws FileNotFoundException { // LinkedList items = new LinkedList(); int c = 9; //Uncomment line below once loadProblem method is complete // loadProblem(items); } }

H3_Q3:

import java.util.ArrayList; import java.util.Collections; public class H3_Q3 { public static void main(String[] args) { //0/1 KP attributes int C = 10; //knapsack capacity ArrayList items = new ArrayList(); //hold possible items to include in knapsack KPItem ki = new KPItem(3, 6); items.add(ki); ki = new KPItem(5, 7); items.add(ki); ki = new KPItem(1, 3); items.add(ki); ki = new KPItem(8, 10); items.add(ki); ArrayList  solution = new ArrayList(Collections.nCopies(items.size(), 0)); //initialize all zeroes, stores 0/1 decisions //Uncomment line below once your knapsack method is included in the class //System.out.println("Optimal Objective Value: " + knapsack(items, items.size() - 1, C,solution)); } }

KP2Item:

public class KP2Item { //declare fields associated with an item for the problem given in Q1 //Constructors }

KP2ItemInfo:

import com.opencsv.bean.CsvBindByName; public class KP2ItemInfo { }

KPItem:

public class KPItem{ //declare fields associated with an item for the problem given in Q2 }

KPItemInfo:

import com.opencsv.bean.CsvBindByName; public class KPItemInfo { }

Question 1 Consider the following optimization problem: max I w;; sd I; {0,1} 1