Operations Research
a)Given the following primal problem:
Maximize Z = 3π₯1 + 2π₯2
Subject to:
3π₯1 + π₯2 ≤ 2
π₯1 + π₯2 ≤ 6 5π₯1 + 3π₯2 ≤ 27
π₯1 ≥ 0 , π₯2 ≥ 0
Question 1: Solve this problem graphically. (6 M)
Question 2: Write the primal problem in Standard form. (4 M)
Question 3: Use the simplex method to solve the primal problem. (8 M)
Question 4: Construct the dual of the primal problem. (5 M)
Question 5: Use the Big_M method to solve the dual problem in Q4. (M=100) (3 + 4 M) Not: Stop in the second iteration (2 tables).
Question 6: (3 + 7 M)
1. Formulate the problem as a transportation model.
2. Use Least-Cost method to obtain an initial basic feasible solution.
CS 340 Milestone One Guidelines and Rubric Overview: For this assignment, you will implement the fundamental operations of create, read, update,
Retail Transaction Programming Project Project Requirements: Develop a program to emulate a purchase transaction at a retail store. This
7COM1028 Secure Systems Programming Referral Coursework: Secure
Create a GUI program that:Accepts the following from a user:Item NameItem QuantityItem PriceAllows the user to create a file to store the sales receip
CS 340 Final Project Guidelines and Rubric Overview The final project will encompass developing a web service using a software stack and impleme