Solve the given transportation problem, using lingo optimization software.

A company has three cement factories F1, F2 and F3 which supply cement to four projects sites located in
towns 1, 2, 3 and 4. Each plant can supply 6,1,10 truckloads of cements daily respectively and the daily
cement requirements of the projects are respectively 7,5,3,2 truckloads. The transportation costs per truck
load of cement (in hundreds of rupees) from each plant to each project site is as follows:

Project 1 Project 2 Project 3 Project 4

Factory 1 2 3 11 7

Factory 2 1 0 6 1

Factory 3 5 8 15 9

Solve the given assignment problem, using lingo optimization software.

Four jobs are to be done on four different machines. The cost (in rupees) of producing ‘i’th job on ‘j’th
machine is given below.
Machine 1 Machine 2 Machine 3 Machine 4

Jobs 1 15 11 13 15

Jobs 2 17 12 12 13

Jobs 3 14 15 10 14

Jobs 4 16 13 11 17

Solve the given assignment problem using Microsoft Excel Solver.

Four jobs are to be done on four different machines. The cost (in rupees) of producing ‘i’th job on ‘j’th
machine is given below.
Machine 1 Machine 2 Machine 3 Machine 4

Jobs 1 15 11 13 15

Jobs 2 17 12 12 13

Jobs 3 14 15 10 14

Jobs 4 16 13 11 17
Solve the given transportation problem, using Excel Solver software.
A company has three cement factories F1, F2 and F3 which supply cement to four projects sites located in
towns 1, 2, 3 and 4. Each plant can supply 6,1,10 truckloads of cements daily respectively and the daily
cement requirements of the projects are respectively 7,5,3,2 truckloads. The transportation costs per truck
load of cement (in hundreds of rupees) from each plant to each project site is as follows:
Factory 1 Project 1 Project 2 Project 3 Project 4

Factory 2 2 3 11 7

Factory 3 1 0 6 1

Factory 4 5 8 15 9

Solve the given transportation problem, using lingo optimization software.

A company has three cement factories F1, F2 and F3 which supply cement to four projects sites located in
towns 1, 2, 3 and 4. Each plant can supply 6,1,10 truckloads of cements daily respectively and the daily
cement requirements of the projects are respectively 7,5,3,2 truckloads. The transportation costs per truck
load of cement (in hundreds of rupees) from each plant to each project site is as follows:

Project 1 Project 2 Project 3 Project 4

Factory 1 2 3 11 7

Factory 2 1 0 6 1

Factory 3 5 8 15 9

Solve the given assignment problem, using lingo optimization software.

Four jobs are to be done on four different machines. The cost (in rupees) of producing ‘i’th job on ‘j’th
machine is given below.
Machine 1 Machine 2 Machine 3 Machine 4

Jobs 1 15 11 13 15

Jobs 2 17 12 12 13

Jobs 3 14 15 10 14

Jobs 4 16 13 11 17
Solve the given transportation problem, using lingo optimization software.
A company has three cement factories F1, F2 and F3 which supply cement to four projects sites located in
towns 1, 2, 3 and 4. Each plant can supply 6,1,10 truckloads of cements daily respectively and the daily
cement requirements of the projects are respectively 7,5,3,2 truckloads. The transportation costs per truck
load of cement (in hundreds of rupees) from each plant to each project site is as follows:

Project 1 Project 2 Project 3 Project 4

Factory 1 2 3 11 7

Factory 2 1 0 6 1

Factory 3 5 8 15 9

Solve the given assignment problem, using lingo optimization software.

Four jobs are to be done on four different machines. The cost (in rupees) of producing ‘i’th job on ‘j’th
machine is given below.
Machine 1 Machine 2 Machine 3 Machine 4

Jobs 1 15 11 13 15

Jobs 2 17 12 12 13

Jobs 3 14 15 10 14

Jobs 4 16 13 11 17

Solve the given assignment problem using Microsoft Excel Solver.

Four jobs are to be done on four different machines. The cost (in rupees) of producing ‘i’th job on ‘j’th
machine is given below.
Machine 1 Machine 2 Machine 3 Machine 4

Jobs 1 15 11 13 15

Jobs 2 17 12 12 13

Jobs 3 14 15 10 14

Jobs 4 16 13 11 17
Solve the given transportation problem, using Excel Solver software.
A company has three cement factories F1, F2 and F3 which supply cement to four projects sites located in
towns 1, 2, 3 and 4. Each plant can supply 6,1,10 truckloads of cements daily respectively and the daily
cement requirements of the projects are respectively 7,5,3,2 truckloads. The transportation costs per truck
load of cement (in hundreds of rupees) from each plant to each project site is as follows:
Factory 1 Project 1 Project 2 Project 3 Project 4

Factory 2 2 3 11 7

Factory 3 1 0 6 1

Factory 4 5 8 15 9

Solve the given transportation problem, using lingo optimization software.

A company has three cement factories F1, F2 and F3 which supply cement to four projects sites located in
towns 1, 2, 3 and 4. Each plant can supply 6,1,10 truckloads of cements daily respectively and the daily
cement requirements of the projects are respectively 7,5,3,2 truckloads. The transportation costs per truck
load of cement (in hundreds of rupees) from each plant to each project site is as follows:

Project 1 Project 2 Project 3 Project 4

Factory 1 2 3 11 7

Factory 2 1 0 6 1

Factory 3 5 8 15 9

Solve the given assignment problem, using lingo optimization software.

Four jobs are to be done on four different machines. The cost (in rupees) of producing ‘i’th job on ‘j’th
machine is given below.
Machine 1 Machine 2 Machine 3 Machine 4

Jobs 1 15 11 13 15

Jobs 2 17 12 12 13

Jobs 3 14 15 10 14

Jobs 4 16 13 11 17
Find the deflection and stress distribution of a cantilever beam of 1000mm x50mm x20mm
dimensions carrying UDL of 50N over its entire length using solid works software

Find the deflection and stress distribution of a cantilever beam of 1000mm x50mm x20mm
dimensions carrying UDL of 50N over its entire length using solid works software

Write a C program to find the root of the equation f(x)=x3 –x-1 lying between 1 and 2, using
bisection method

Write a C program to find the solution of dy/dx= y-x where y(0)=2, find y(0.1) and y(0.2). using
second orderRunge-Kutta method.

Write a C program to find the root of the equation f(x)=x3 –x-1 lying between 1 and 2, using
bisection method

Write a C program to find the solution of dy/dx= y-x where y(0)=2, find y(0.1) and y(0.2). using
second orderRunge-Kutta method.

Write a C program to find the root of the equation f(x)=x3 –x-1 lying between 1 and 2, using
bisection method

Write a C program to find the solution of dy/dx= y-x where y(0)=2, find y(0.1) and y(0.2). using
second orderRunge-Kutta method.

Write a C program to find the root of the equation f(x)=x3 –x-1 lying between 1 and 2, using
bisection method

Write a C program to find the solution of dy/dx= y-x where y(0)=2, find y(0.1) and y(0.2). using
second orderRunge-Kutta method.

Write a C program to find the root of the equation f(x)=x3 –x-1 lying between 1 and 2, using
bisection method

Write a C program to find the solution of dy/dx= y-x where y(0)=2, find y(0.1) and y(0.2). using
second orderRunge-Kutta method.
Write a C program to find the root of the equation f(x)=x3 –x-1 lying between 1 and 2, using
bisection method

Write a C program to find the solution of dy/dx= y-x where y(0)=2, find y(0.1) and y(0.2). using
second orderRunge-Kutta method.

Write a C program to find the root of the equation f(x)=x3 –x-1 lying between 1 and 2, using
bisection method

Write a C program to find the solution of dy/dx= y-x where y(0)=2, find y(0.1) and y(0.2). using
second orderRunge-Kutta method.

Write a C program to find the root of the equation f(x)=x3 –x-1 lying between 1 and 2, using
bisection method

Write a C program to find the solution of dy/dx= y-x where y(0)=2, find y(0.1) and y(0.2). using
second orderRunge-Kutta method.

Write a C program to find the root of the equation f(x)=x3 –x-1 lying between 1 and 2, using
bisection method

Write a C program to find the solution of dy/dx= y-x where y(0)=2, find y(0.1) and y(0.2). using
second orderRunge-Kutta method.

Write a C program to find the root of the equation f(x)=x3 –x-1 lying between 1 and 2, using
bisection method

Write a C program to find the solution of dy/dx= y-x where y(0)=2, find y(0.1) and y(0.2). using
second orderRunge-Kutta method.

Write a C program to find the root of the equation f(x)=x3 –x-1 lying between 1 and 2, using
bisection method

Write a C program to find the solution of dy/dx= y-x where y(0)=2, find y(0.1) and y(0.2). using
second orderRunge-Kutta method.

Write a C program to find the root of the equation f(x)=x3 –x-1 lying between 1 and 2, using
bisection method
Write a C program to find the solution of dy/dx= y-x where y(0)=2, find y(0.1) and y(0.2). using
second orderRunge-Kutta method.

Write a C program to find the root of the equation f(x)=x3 –x-1 lying between 1 and 2, using
bisection method

Write a C program to find the solution of dy/dx= y-x where y(0)=2, find y(0.1) and y(0.2). using
second orderRunge-Kutta method.