Introduction to Operations Research - - Unit 12 - Module 8 : Solving LPs using a solver Page 1 of 5

[email protected] ▼

Courses » Introduction to Operations Research

Announcements Course Forum Progress Mentor

Unit 12 -
Module 8 : Solving LPs using a solver

Course M8A1 Assignment 1

outline
Due date for this assignment: 2017-03-22, 23:59 IST.
How to
1)
access the Maximize 7X1 + 15X2 + 3X3 + 14X4
portal
Subject to
6X1 + 4X2 + 5X3 + 10X4 <=30
Module 1 :
Linear 16X1 + 14X2 + 15X3 + 10X4 <= 50
Programming 8X1 + 10X2 + 9X3 + 11X4 <= 40
– Introduction
and 2X1 + X2 + 3X3 + 8X4 ≥ 10
formulations Xj ≥ 0
Find the objective function value at the optimum? Find the value of the dual
Module 2 : variable Y2 at optimum?
Graphical and
Algebraic
methods **ENTER YOUR ANSWER IN THE FORMAT (OBJ VALUE,Y2)=(a/b,c/d)
WITH BRACKETS AND NO SPACE IN BETWEEN
Module 3 :
Simplex
Algorithm 1 point

sample 2)
Minimize 5X1 + 4X2 + 13X3 + 4X4
Subject to
Module 4 :
Dual 6X1 + 4X2 + 5X3 + 10X4 ≥ 30
16X1 + 14X2 + 15X3 + 10X4 ≥ 50
Module 5 : 8X1 + 10X2 + 9X3 + 11X4 <= 40
Primal dual
relationships 12X1 +3X2 + 9X3 + 18X4 ≥ 30
Xj ≥ 0.
Module 6 : Find the value of the objective function at the optimum? Find the value of dual
Transportation variable Y3 at optimum?
problem
**enter your answer in the form (a,c/d)

https://onlinecourses.nptel.ac.in/noc17_mg10/unit?unit=71&assessment=72 22-03-2017
Introduction to Operations Research - - Unit 12 - Module 8 : Solving LPs using a solver Page 2 of 5

Module 7 :
Assignment 1 point
Problem
3) Maximize 7X1 + 5X2 + 3X3 + 14X4 1 point

Module 8 : Subject to
Solving LPs 6X1 + 4X2 + 5X3 + 10X4 <= 15
using a 16X1 + 14X2 + 15X3 + 10X4 ≥ 60
solver
Xj ≥ 0
Quiz : M8A1
Assignment The solver gives an optimum solution
1 The problem is unbounded
Quiz : M8A2 The problem is infeasible
Assignment-2
4) Maximize 7X1 - 5X2 + 3X3 + 14X4 1 point
Lec 1 :
Subject to
Setting up
the problem 6X1 - 4X2 + 5X3 + 10X4 <= 30
and solving 16X1 - 14X2 + 15X3 + 10X4 <= 50
simple LP
Xj ≥ 0
problems

Lec 2 : The solver gives an optimum solution

Unboundedness The problem is unbounded
and
infeasibility The problem is infeasible

Lec 3 : 5)
Solve the following 4 supply 5 demand transportation problem where the
Solving
other
supply quantities are 80, 100, 90, 60. The demand quantities are 70, 75, 55,
formulations 65, 65. The transportation costs are given in the table. Find the minimum cost
of transportation?
Lec 4 :
Solving a
transportation
problem

Lec 5 :
Solving an
assignment
problem

1 point

6)
Solve the following 5 x 5 assignment problem. Find the least cost solution and
the second least cost solution. Also find the profit for the original problem with
maximization objective? (Hint: Solve the minimization problem first. There will
be 5 assignments. Solve 5 problems by taking each of the assignments and
putting a large cost (M or use 1000 as value) for this assignment. The
minimum among the five solutions gives the second best minimum cost)

https://onlinecourses.nptel.ac.in/noc17_mg10/unit?unit=71&assessment=72 22-03-2017
Introduction to Operations Research - - Unit 12 - Module 8 : Solving LPs using a solver Page 3 of 5

**ENTER YOUR ANSWER IN THE FORMAT (A,B,C) IN THE DESIRED

SEQUENCE, WITH BRACKET, WITHOUT SPACE

1 point

7)
Solve the following 4 supply 5 demand transportation problem where the
supply quantities are 100, 100, 90, 80. The demand quantities are 70, 75, 55,
65, 65. The transportation costs are given in the table.

***ENTER YOUR ANSWER IN THE FORMAT (A,B) WITH BRACKETS AND

WITHOUT SPACE

1 point

8)

https://onlinecourses.nptel.ac.in/noc17_mg10/unit?unit=71&assessment=72 22-03-2017
Introduction to Operations Research - - Unit 12 - Module 8 : Solving LPs using a solver Page 4 of 5

Consider the following assignment problem with four persons and 5 jobs.

One person gets two jobs. Solve an assignment like problem to find
the minimum cost? Person number ___ gets two jobs.

**ENTER YOUR ANSWER IN THE FORMAT

(MINIMUM_COST,PERSON_NO) WITH BRACKETS, WITHOUT SPACE

1 point

9)
Consider the caterer problem where demand for 8 days. The demands are
200, 80, 140, 90, 100, 150, 80 and 180. The cost of new napkin is Rs 100.
There are two types of laundries – fast and slow. Fast laundry takes 2 days
(napkins put at end of day 1 can be used from day 3 onwards) and costs Rs
25. Slow laundry takes 3 days (napkins put at end of day 1 can be used from
day 4 onwards) and costs Rs 15. Solve an LP to minimize total cost?

1 point

10)
Consider a bin packing problem with 8 items whose lengths are 31, 29, 23, 19,
17, 13, 11 and 7. The bin length is 40. Verify whether 4 bins are enough? If
two bins are of lengths 40 and the other two are of length 36, can we
accommodate the lengths in 4 bins? If we have only three bins, what is the
minimum bin size to accommodate these lengths?

**ENTER YOUR ANSWER IN THE FORMAT (YES,NO,SIZE) WITH

BRACKETS, WITHOUT SPACE. THE ANSWER IS CASE INSENSITIVE

1 point

You may submit any number of times before the due date. The final submission will
be considered for grading.
Submit Answers

https://onlinecourses.nptel.ac.in/noc17_mg10/unit?unit=71&assessment=72 22-03-2017
Introduction to Operations Research - - Unit 12 - Module 8 : Solving LPs using a solver Page 5 of 5

Previous Page Next Page

© 2014 NPTEL - Privacy & Terms - Honor Code - FAQs -

0

A project of In association with

Funded by

Powered by

https://onlinecourses.nptel.ac.in/noc17_mg10/unit?unit=71&assessment=72 22-03-2017