- Consider the following linear programming problem:
a) maximize z = 2x1 + 5x2
subject to
3x1 + x2 > 1 2x1 x2 < 6 x2 < 5 xi, x2 > 0
(a) Plot the feasible region, and find the optimal feasible solution by investigating corner points. 8 marks Solve the problem using the simplex method (by hand). 8 marks Find the amount which the coefficient in front of x2 in the objective function can change without changing the optimal solution. 4 marks Find the amount by which the value on the right hand side of the first constraint can change without making the optimal solution infeasible. [4 marks]
Our Free Services
Paper Formatting
- Double or single-spaced
- 1-inch margin
- 12 Font Arial or Times New Roman
- 300 words per page
No Lateness!
Our orders are delivered strictly on time without delay
Our Guarantees
- Free Unlimited revisions
- Guaranteed Privacy
- Money Return guarantee
- Plagiarism Free Writing
Linear programming
Our Services
- Research Paper Writing
- Essay Writing
- Dissertation Writing
- Thesis Writing
Daily Statistics
- 134 New Projects
- 235 Projects in Progress
- 432 Inquiries
- 624 Repeat clients
Why Choose Us
- Money Return guarantee
- Guaranteed Privacy
- Written by Professionals
- Paper Written from Scratch
- Timely Deliveries
- Free Amendments