Solve the problem for each of the following objective functions: (Two-Pha Method) (a) Maximize z 2x1 + 3x25x3 (b) Minimize z = 2x1 + 3x2 - 5x3 (c) Maximize z = x1 + 2X2 + X3

Combined-cycle power plants use two combustion turbines to produce electricity. Heat from the first turbine’s exhaust is captured to heat waterand produce steam sent to a second steam turbine that generates additional electricity. A 968-megawatt combined-cycle gas fired plant can be purchased for $450 million, has no salvage value, and produces a net cash flow(revenues less expenses) of $50 million per year over its expected 30-year life. Solve, a. If the hurdle rate (MARR) is 12% per year, how profitable an investment is this power plant? b. What is the simple payback period for the plant? Is this investment acceptable?

Let’s consider the following LP problem:   min            Subject to:                                                                                                      Solve the problem with the graphic method.

I’ve been able to find the optimal solution and resulting profit with excel solver. But can’t figure out how to set up the problem with POM QM

A manufacturer has the capability to produce both chairs and tables. Both products use the same materials (wood, nails and paint) and both have a setup cost ($100 for chairs, $200 for tables). The firm earns a profit of $20 per chair and $65 per table and can sell as many of each as it can produce. The daily supply of wood, nails and paint is limited. To manage the decision-making process, an analyst has formulated the following linear programming model:Max 20x1 + 65x2 – 100y1 – 200y2s.t. 5x1 + 10x2 ≤ 100 {Constraint 1}20x1 + 50x2 ≤ 250 {Constraint 2}1x1 + 1.5x2 ≤ 10 {Constraint 3}My1 ≥ x1 {Constraint 4}My2 ≥ x2 {Constraint 5}yi={1, if product j is produced0, otherwiseyi=1, if product j is produced0, otherwiseWhich of the constraints limit the amount of raw materials that can be consumed?   A. Constraint 1 B. Constraint 4 C. Constraint 5 D. Constraint 1 and 4 E. Constraint 1, 2 and 3

Dickie Hustler has $2 and is going to toss an unfair coin(probability .4 of heads) three times. Before each toss, hecan bet any amount of money (up to what he now has). Ifheads comes up, Dickie wins the number of dollars he bets;if tails comes up, he loses the number of dollars he bets.Use dynamic programming to determine a strategy thatmaximizes Dickie’s probability of having at least $5 afterthe third coin toss.

A car company is planning the introduction of a new electric car.  There are two options for production.  One is to produce the electric car at the company’s existing plant in Illinois, sharing production with its other products that are currently being produced there.  If the sales of the electric car are moderate, this will work out well as there is significant capacity to produce all of the products there.  However, if sales of the electric car are strong, this option would necessitate Adding a 3rd shift, which would lead to significantly higher costs. Another option is to build a new plant in Ohio.  The new plant would have sufficient capacity to meet whatever level of demand for the new car.  However, if sales of the new car not strong, the plant would be underutilized and less efficient. Since this is a new product, sales are hard to predict.  The forecast indicates there is a 60% chance of strong sales (annual sales of 100,000), and 40% chance of moderate sales (annual sales of…

The sketch of a feasible region is given below, which point is not a point consistent with a production option for this programming problem? (0,10) (0,8) (0,0) O (0,6) O (4,0) O (4,2) O (6,0) (2,8) (6,4) (6,0) 27 (10,0) They are all in the feasible region.

Please no written by hand solution

Define n/n problem with a suitable practical example. Multiple solution in case of certain n/2 problem? Explain.