Linear Programming: Graphical Method Formulate the LP problem, which includes the objective function and the constraints. Then solve. Use Desmos calculator to graph. A furniture company produces inexpensive tables and chairs. The production process for each is similar in that both require a certain number of hours of carpentry work and a certain number of labor hours in the painting department. Each table takes 4 hours of carpentry and 2 hours in the painting department. Each chair requires 3 hours of carpentry and 1 hour in the painting department. During the current production period, 240 hours of carpentry time are available and 100 hours in painting is available. Each table sold yields a profit of P600; each chair produced is sold for a 250ドル profit. Find the best combination of tables and chairs to manufacture in order to reach the maximum profit.

Please Describe in detail how to solve

Using pyhton coding to solve: Suppose the Great Frederick Fair wants to update its ticketing software. They need you to write a program to handle the price calculations, using the rules*: ●くろまる The basic price of a ticket is 40ドル. Senior citizens (age >= 65) get a 50% discount. Children under 6 are free (100% discount). For residents of Frederick County, the basic price is 35ドル; the same discounts still apply. So the individual ticket prices range from 0ドル to 40ドル. ●くろまる . Your program should request age and county name from the user. The age will be entered as an integer and the county name as a string. Before calculating the price, confirm that the user's age is valid - not negative and not more than 110. If it is not, give a message and do not do the price calculation. Also, the county name should not be case sensitive - for example, Frederick, frederick, and FREDERICK should all be acceptable. Your program should then calculate and print out the ticket price, using the appropriate...

Bresenham's circle drawing technique requires a value of p, a decision parameter, to be determined. Bresenham's method for drawing a circle is detailed in this article.

Knapsack 0/1 problem: Given N items where each item has some weight and profit associated with it and also given a bag with capacity W, [i.e., the bag can hold at most W weight in it]. The task is to put the items into the bag such that the sum of profits associated with them is the maximum possible. Given the problem is solved using a dynamic programming approach and the matrix derived is given below, answer the below set of questions by analyzing the DP matrix. weights = [2, 3, 4, 5], profits = [1, 2, 5, 6], Capacity W = 8 Capacity 2 3 Profits weights|0 1 2 5 16 14 |-> 5 10 0 O 10 1 2 3 4 0 O 0 1 1 0 1 0 1 O 10 1 2 2 2 5 2 O 15 50 1 356 6 O 1 3 6 18 00378 7 10 10 1 3 7 7 1 18

Rod cutting problem: A cutting factory buys long steel rods and then and cuts them into shorter rods, which it then sells. Each cut is free. The selling price is based on the length of the cut. The factory want to determine the best cuts in order to maximize its revenue. Below, the price that the factory can make for each length of rod is given. Determine the maximum revenue, rn, obtainable by cutting up the rod and selling the pieces using bottom-up dynamic-programming approach. Length, I 1 2 3 4 5 6 7 Price, pi 2 4 5 6 9 10 12 r5 = ?