A theft robbing a store find n items; the ith element is worth vi dollars and weight wi pounds. He wants to take as valuable load as possible, but he can carry at most W pounds in his knapsack. The theft is allowed to take fraction of an item for the fraction of the weight and fraction of the value. Determine which items should he take? The goal is to maximize the value of items without exceeding the weight limit W of knapsack. item_1(price=30$, weight=10kg) , item_2(price=100$, weight=25kg) item_3(price=250$, weight=50kg), item_4(price=30$, weight=30kg) item_5(price=20$, weight=10kg), Knapsack capacity (W)=100kg

A theft robbing a store find n items; the ith element is worth vi dollars and weight wi pounds. He wants to take as valuable load as possible, but he can carry at most W pounds in his knapsack. The theft is allowed to take fraction of an item for the fraction of the weight and fraction of the value. Determine which items should he take? The goal is to maximize the value of items without exceeding the weight limit W of knapsack. item_1(price=30$, weight=10kg) , item_2(price=100$, weight=25kg) item_3(price=250$, weight=50kg), item_4(price=30$, weight=30kg) item_5(price=20$, weight=10kg), Knapsack capacity (W)=100kg

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter17: Markov Chains

Section: Chapter Questions

Problem 4RP

See similar textbooks

Similar questions

A thief enters a house for robbing it. He can carry a maximal weight of 5 kginto his bag. There are 4 items in the house with the following weights and values. Whatitems should thief take if he either takes the item completely or leaves it completely?
Maximum weight = 20The above problem is a 0/1 Knapsack problem. Here there are 7 different objects labelled from A to G. The objective of this problem is to carry the different objects in your bag in such a way such that the profit is maximized. But you have to make sure that your bag does not exceed the maximum weight i.e. the maximum weight that this bag can carry is less than or equal to 15. Remember you can carry an object exactly once. Now it is your job to use Genetic Algorithm to solve this problem. 1. Encode the problem and create an initial population of 4 different chromosomes 2. Think of an appropriate fitness function to this problem and give proper justification. 3. Use the fitness function to calculate the fitness level of all the chromosomes in your population 4. Perform natural selection and select the two fittest chromosomes 5. Use the parents from (4) and perform crossover to get 2 offspring 6. Perform mutation and check the fitness of the final offspring. Comment…
A circus is planning a tower act in which individuals stand on top of one another's shoulders. Each individual must be both shorter and lighter than the person below him or her for practical and aesthetic reasons. Write a way to determine the maximum feasible number of people in such a tower given the heights and weights of each individual in the circus.
There are three financial aid counselors. If a student’s last initial is from A – H, let them know that their counselor is Jon Stewart. If a student’s last initial is from I – Q, let them know that their counselor is Chelsea Handler. If a student’s last initial is from R – Z, let them know that their counselor is Brian Williams.Ask student for the FICO score, if it’s less than 660 tell that this student cannot have a loan.
A team sport game has m players in a team and a tournament can have n competing teams. TeamT1 ranks higher than team T2 if there is a way such that every member of T1 ranks higher than acorresponding member of T2 (note that the ranking is based on individual team members).(1) Design an efficient algorithm (pseudo code) to determine whether or not two teams T1and T2 can be ranked.(2) Given n teams {T1, T2, ... , Tn}, abstract the team ranking problem as a graph.(3) Design an efficient algorithm (pseudo code) to find the longest sequence <Ti1 , Ti2 ,..., Tik> of teams such that Tij ranks higher than Tij + 1 for j = 1,2,..., k − 1.(4) Analyze the time complexity of your algorithm in terms of m and n.
Construct a DFA A so that L(A) = L(N) where N is the following NFA:
A group of n tourists must cross a wide and deep river with no bridge in sight. They notice two 13-year-old boys playing in a rowboat by the shore. The boat is so tiny, however, that it can only hold two boys or one tourist. How can the tourists get across the river and leave the boys in joint possession of the boat? How many times need the boat pass from shore to shore?
Suppose we have a nice young couple who borrow $700000 from the bank, at an annual interest rate of3.124%. The mortgage is a 30 year loan, so they need to pay it off within 360 months total. Our happycouple decide to set their monthly mortgage payment at $2000 per month. Will they pay off the loan intime or not?Note that the monthly balance will be calculated asbalance = (im × previous balance) - monthly paymentwhere the convert annual interest to a monthly multiplier im is calculated as im = (1 +i)1/12 and i = annualinterest rate.Write a loop for track the total payment in 360 months so that we can evaluate if the couple can pay off theloan. Write in R Please and thank you.
In a company, there are several branches. Let us consider a branch of that company having N employees, if the manager is allotted to that branch(s) then he is known to everyone else in that branch. Note that the property of "known to everyone" is unique to a manager. Your task is to find the manager in that branch. Input from the user in main ( ), the square matrix M where if an element of row i and column j is set to 1 it means that ith person knows jth person. You need to write a function managerId ( ) which returns the id of the manager if present or else returns -1. The function managerId ( ) takes two arguments - the square matrix of N *N and its size N. Call managerId ( ) from the main ( ) output the information about the manager. Assume all diagonal elements to be 1 (as everyone knows him/herself) and there is at most one manager in the company.
In the refrigerator example, suppose the warranty worksas follows. If a refrigerator fails at any time within 5 yearsof purchase, we give the consumer a prorated refund on the$500 purchase price. For example, if the refrigerator failsafter 4 years, we pay the customer $100. If the refrigeratorfails after 3 years, we pay the customer $200. Estimate ourexpected warranty expense per refrigerator sold.
For tax purposes an item may be depreciated over a period of several years, n.With the straight line method of depreciation, each year the item depreciates by 1/nth of itsoriginal value. With the double declining balance method of depreciation, each year the itemdepreciates by 2/nths of its value at the beginning of that year. (In the final year it is depreciatedby its value at the beginning of the year.)Write a program using **Visual Basic** that performs the following tasks:1.1 Request a depreciation of the item, the year of purchase, the cost of the item, the number ofyears to be depreciated (estimated life), and the method of depreciation. The method ofdepreciation should be chosen by clicking on one of two buttons.1.2 Display a year by year description of the depreciation.
You are given a 2 by n grid, where the cell on row i column j contains a non-negative number ai,j . You can start at either cell in the lefttmost column, and your goal is to reach either cell in the rightmost column by a sequence of moves. You can move to an adjacent cell (if it exists) in each of the 4 cardinal directions (up,down, left and right). A path achieves a score equal to the sum of values in its cells. Note that a cell which is used twice in a path only counts its value once to the score of that path.Design an algorithm which runs in O(n) time and finds a path of minimum score from the leftmost column to the rightmost column.