In this paper the aim of work is to introduce
dual simplex method to solve transportation problem
with fuzzy objective functions. The Simplex has wide use
transportation problem. It aims to minimize the cost of
transportation. The fuzzy objective functions have fuzzy
demand and supply coefficients, which are represented
as fuzzy numbers. For this we are solving fuzzy
transportation problem by dual simplex method.

© All Rights Reserved

257 views

Application of a Dual Simplex method to Transportation Problem to minimize the cost

In this paper the aim of work is to introduce
dual simplex method to solve transportation problem
with fuzzy objective functions. The Simplex has wide use
transportation problem. It aims to minimize the cost of
transportation. The fuzzy objective functions have fuzzy
demand and supply coefficients, which are represented
as fuzzy numbers. For this we are solving fuzzy
transportation problem by dual simplex method.

© All Rights Reserved

- Duality
- JNTUA MBA Draft Syllabus 2014-15
- Train Schedule Optimization in Public Rail Transport
- Optimal Cost Design of Water Distribution Networks
- 11. Management-Application of Linear Programming-Dr Agarana, M.C.
- Goal Programming
- IEOR4004-notes1
- Operations Research Summary
- Chapter 6
- Ship Routing
- Stochastic Model Predictive Control
- Formulations for a Problem of Petroleum Transportation
- Exercises Nosol
- Week 1 Overview
- B Mollica Section003 SimplexMethod-RestaurantMenuOptimization (1)
- LinearProgramming.doc
- Block 4 MEC 003 Unit 12
- 7 ME F344 Engineering Optimization AKGupta
- LPP_2
- Two.Phase.Simplex.pdf

You are on page 1of 5

International Journal of Innovations in Engineering and Science, Vol. 2, No.7, 2017

www.ijies.net

Transportation Problem to minimize the cost

Manisha.V. Sarode

Assistant Professor, Dept. of Mathematics, Priyadarshini Indira Gandhi College of Engineering, Nagpur

Email:manishavsarode@gmail.com

.

Abstract In this paper the aim of work is to introduce obtained with other nonlinear solution methods. Lin and

dual simplex method to solve transportation problem Tsai [11] investigated solving the transportation problem

with fuzzy objective functions. The Simplex has wide use with fuzzy demands and fuzzy supplies using a two-

transportation problem. It aims to minimize the cost of stage GA. This study suggests methods of linear

transportation. The fuzzy objective functions have fuzzy programming approach to solving the transportation

demand and supply coefficients, which are represented problem with fuzzy demands and fuzzy supplies. The

as fuzzy numbers. For this we are solving fuzzy numerical solved by dual simplex method. In this

transportation problem by dual simplex method. method the coefficients of objective function are in the

form of fuzzy numbers and changing problem in linear

Keywords - Linear programming problem, Simplex programming problem then solved by dual simplex

method, Transportation problem, Profit. method. At first Danting G.A. and P. Wolfe [5] (1955)

generalised simplex method for minimizing a linear form

1. INTRODUCTION under inequality restraints. The simplex method starts

with a dictionary which is feasible but does not satisfy

the optimality condition on the Z equation. It performs

The transportation problem is a special type of linear successive pivot operations preserving feasibility to find

programming problem which arises in many practical a dictionary which is both feasible and optimal. The dual

applications. The transportation model has wide practical simplex method starts with a dictionary which satisfies

applications, not only in transportation systems, but also the optimality condition on the Z equation, but is not

in other systems such as production planning [3]. The feasible. It then performs successive pivot operations,

concept of fuzzy set theory, first introduced by Zadeh which preserve optimality, to find a dictionary which is

[19] is used for solving different types of linear both feasible and optimal.

programming problems [1]. After that, especially after Linear programming model is extensively used to solve

1990s various models and algorithms under both crisp the variety of problems in Engineering and

environment and uncertain environment are presented. Management field particularly for production planning

For ex. Bit Et [2]. Al, Jimnez and Verdegay [7,8], Li et. and optimum resources allocation. To solve linear

Al. [9], Srinivasan and programming problem, Dantzig devised simplex method

Thompsom [18], L. Liu and B. Liu [12]. Liu and Kao in 1947. ASimplex algorithm of Dantzig is one of the top

[13] developed a method to find the membership 10 algorithms of 20 th century [Barry Cipra (3)]. The

function of the fuzzy total transportation cost when the computational complexity in simplex method depends

unit shipping costs, the supply quantities, and the on the number of variables and the number of constraints

demand quantities are fuzzy numbers. Jimenez and and is directly proportional to both. To reduce the

Verdegay [8] proposed a GA to deal with the fuzzy solid complexity, several variants of simplex method are

transportation problem in which the fuzziness affects developed by various researchers. For details Gass (2)

only in the constraint set. They concluded that GA can be referred. If in the given linear programming

showed a good performance in finding parametric problem, one or more constraints are type or equality,

solutions in comparison with nonparametric solutions simplex method with artificial basis techniques is used.

51

Impact Factor Value 3.441 e-ISSN: 2456-3463

International Journal of Innovations in Engineering and Science, Vol. 2, No.7, 2017

www.ijies.net

Big-M method and two phase simplex method are quite resources (usually a large mix of many different

commonly used. In these methods artificial variables are resources) will be used completely. While some might be

used to get the standard basis artificially. Artificial used completely, others will have some unused capacity.

variables are then forced to leave the basis step by step. Also, slack variables allow us to change the inequalities

Once all the artificial variables are removed from the in the constraint equations to equalities, which are easier

basis, optimal solution is then obtained by using regular to solve algebraically. Slack variables represent the

simplex method. However, use of artificial variables to unused resources between the left-hand side and right-

get the standard basis increases the computational hand side of each inequality; in other words, they allow

complexity due to the reason mentioned above. To avoid us to put the LP problem into the stan- dard form so it

the use of artificial variables, the type constraints are can be solved using the simplex method. The first step is

converted into type constraints by multiplying by -1. to convert the inequalities into equalities by

Then using slack variables only, initial basic solution is adding slack variables to the two constraint inequalities.

obtained that is not feasible. In other words, one starts With S W representing surplus wood, and S L

with infeasible solution. Methods are developed to solve representing surplus labor, the constraint equations can

linear programming problem by starting with infeasible be written as:

solution and force the solution to be feasible as well as 30X1 + 20X2 + SW = 300 (wood constraint: 300 bf)

optimal at some iteration. One such method namely dual 5X1 + 10X2 + SL= 110 (labor constraint: 110 hours)

simplex method devised by Lemke (5) is most popular. All variables need to be represented in all equations. Add

In dual simplex method, starting from infeasible solution slack variables to the other equations and give them

feasible solution is obtained step by step. Another basis- coefficients of 0 in those equations. Rewrite the

exchange pivoting algorithm is the criss-cross algorithm objective function and constraint equations as:

by Terlaky, Tams (4) .There are polynomial-time Maximize: Z = 6X1 + 8X2 + 0SW+ 0 SL(objective

algorithms for linear programming that use interior point function)

methods: These include Khachiyan's ellipsoidal Subject to: 30X1 + 20X2 + SW + 0 SL= 300 (wood

algorithm, Karmarkar's projective algorithm, and path- constraint: 300 bf)

following algorithms. Interested readers can refer Robert 5X1 + 10X2+ 0SW + SL = 110 (labor constraint: 110

J. Vanderbeib (1). In the proposed method in this article, hours)

we start with initial basic solution that is infeasible. Then X1 , X2, SW , SL > 0 (nonnegative conditions)

by judicious selection of entering and leaving vector in We can think of slack or surplus as unused resources that

and from the initial simplex table, feasible solution is dont add any value to the objective function. Thus, their

obtained in the first iteration only and optimal solution coefficients are 0 in the objective function equation.

then can be obtained using regular simplex method. Unit Profit

Notations: The proposed method can be used to solve the Basic mix 6 8 0 0

linear programming problem of the type

X1 X2 SW SL Solution

By introducing the idea of slack variables (unused SL 5 10 0 1 110

resources) to the tables and chairs problem, we can add

two more variables to the problem. With four variables,

we cant solve the LP problem The next step is to determine the exiting variable. The

graphically. Well need to use the simplex method to exiting variable is the variable that will exit the basic

solve this more complex problem. mix when you construct your next simplex tableau. Well

Well briefly present the steps involved in using the find the exiting variable by calculating the exchange

simplex method before working through an example. ratio for each basic variable. The exchange ratio tells us

Table 2 shows an example of a simplex tableau. how many tables or chairs can be made by using all of

Although these steps will give you a the resource for the current respective basic variable. To

general overview of the procedure, youll probably find find the exchange ratio, divide the solution value by the

that they become much more understandable as you corresponding exchange coefficient in the entering

work through the example. variable column. The exchange ratios are:

Using the simplex method, the first step is to recognize 300/20 = 15 (SWbasic mix row)

surplus resources, represented in the problem as slack and 110/10 = 11 (S L basic mix row)

variables. In most real-life problems, its unlikely that all By using all 300 board feet of wood, we can make

52

Impact Factor Value 3.441 e-ISSN: 2456-3463

International Journal of Innovations in Engineering and Science, Vol. 2, No.7, 2017

www.ijies.net

a chair. By using all 110 hours of labor, we can make 11 exchange ratios:

chairs because it takes 10 hours of labor per chair. Thus, 80/20 = 4

its easy to see the plant cant manufacture 15 chairs. We and 11/0.5 = 22

have enough wood for 15 chairs but only enough labor Now choose the s

for 11. Unit Profit

Unit Profit Basic 6 8 0 0

Basic mix 6 8 0 0 mix

X1 X2 SW SL Solution X1 X2 S SL Solution

W

0 SW 30 20 1 0 300 300/20

=15 0 SW 20 0 1 -2 80 80/20=4

0 SL 5 10 0 1 110 110/10 8 X2 0.5 1 0 0.1 11 11/0.5=22

=11

Sacrifice 0 0 0 0 0 Current Sacrifice 4 8 0 0.8 88

profit

Improve 2 0 0 -0.8 --

Improvem 6 8 0 0 --

ment

ent

Now well find the values for the S W row. Referring to Unit Profit

Table 8a, find the value in the S W row in the old tableau

in the pivot element column (20). Multiply it times the Basic 6 8 0 0

first value in the new X 2 row (0.5 from Table 8b). mix

Subtract your answer from the value in the first position X1 X2 SW SL Solution

of the old S W row. 6 X1 1 0 0.05 -0.1 4

Unit Profit

8 X2 0 1 -0.025 0.1 9

Basic mix 6 8 0 0

X1 X2 SW SL Solution Sacrifice 6 8 0.1 0.6 96

0 SW 20 0 1 -2 80 300/20

=15 Improve 0 0 -0.1 -0.6 --

ment

8 SL 0.5 1 0 0.1 11 110/10

=11 There are no positive numbers in the new improvement

row.Thus, we no longer can improve the solution to the

Sacrifice 4 8 0 0.8 88 Current

problem. This simplex tableau represents the optimal

profit

solution to the LP problem

Improve 2 0 0 -0.8 -- and is interpreted as: X 1 = 4, X 2 = 9, S W = 0, S L = 0,

ment and profit or Z = Rs.96

The optimal solution (maximum profit to be made) is to

We now see that profit has been improved from 0 to Rs. manu-facture four tables and nine chairs for a profit of

88. Replace the entering variable in the basic mix where Rs.96.

the exiting variable left. Bring over the unit profit from

the top row of the oldtable to the new table. Fill in the The Simplex method for solving transportation

pivot element row by dividing through by the pivot problem:

element. A company has three toys factories located in cities A, B,

The greatest per-unit improvement is2 (X 1 column). The C which supply toys to four projects in towns 1,2,3,4.

others offer no improvement (either 0 or a negative Each plant can supply 6,1,10 truck loads of toys daily

number). X 1 becomes the new entering variable. Mark respectively and daily toys requirements of the projects

the top of its column with an arrow (Table 8e). are repectively 7,5,3,2 truck loads. The transportation

Remember, when no improvement can be found at this costs per truck load of toys (in hundred Rs) from each

step, the current tableau represents the optimal solution. plant to each project site are as follows:

Now determine the exiting variable. To do so, first

53

Impact Factor Value 3.441 e-ISSN: 2456-3463

International Journal of Innovations in Engineering and Science, Vol. 2, No.7, 2017

www.ijies.net

Project cities

1 2 3 4 1 2 5 3 11(+) 7(-)

Factories 1 2 3 11 7

1(-) 0(-) 6(+) 1 1

2 1 0 6 1

3 5 8 15 9 6 5 8(-) 15 1 9

Determine the optimal distribution for the company so as

to minimize the total transportation cost. 1 2 5 3 11 7

First we construct the transportation table and we

1 0 6 1-1 1

express the supply from the factories, demands at cities =1

and the unit shipping cost in following table.

6 5 8 3-1 15 1+1 9

Project cities

1 2 3 4 Sup 1-1 5 11( = 7

Factor ply

ies 2 3 1)

1 2 3 11 7 6

2 1 0 6 1 1 1 6 1

3 5 8 15 9 10 1 0

Demand 7 5 3 2 17 6+1 5 2-1 15 2 9

8

Now find the initial feasible solution. Transportation cost

according to route is 1 2 5 3 11(+) 7(-)

= . 1 2 + 5 3 + 1 1 + 6 5 + 3 15 + 1

9 100 = 10,200. 1(-) 0(-) 1 6 1

As the number of a allocation=m+n-1=6, thus we can (-)

apply MODI method. 6 5 8(-) 2 15 2 9

Now we can compute net evolutions = +

5 3 1 11 7(-)

2(-)

0(-) 1 6 1(-)

1 2 5 3 11 7 1(-)

1 0 6 1 1 7 5 8(-) 1 15 2 9

6 5 8 15 1 9

5 3 1 11 7(-)

2(-)

Now draw a closed path beginning and ending at ()

cell. Add and substract 0(-) 1 6 1(-)

() . 1(-)

7 5 8(-) 1 15 2 9

1 2 5 3 11 7

1 0 6 1 1(-)

Since all the net evalutions are, this basic feasible

6 5 8 3 15(-) 1 9()

solution is optimal.

Transportation cost of this revised solution is

Transportation cost of this revised solution is = . 5 3 + 1 11 + 1 6 + 7 5 + 1 15 + 2

= . 1 2 + 5 3 + 1 6 + 6 5 + 2 15 + 2 9 100 = . 10,000.

9 100 = . 10,100.

Since the cell (1,3) has a positive value, the second basic

feasible solution is not optimal.

54

Impact Factor Value 3.441 e-ISSN: 2456-3463

International Journal of Innovations in Engineering and Science, Vol. 2, No.7, 2017

www.ijies.net

Applications of Network Optimization, (1992), pp.2 5-31.

Thus here we discuss the simplex method to find optimal

[8] Ahuja, R.K. and Orlin J.B., Improved Primal Simplex

solution of transportation problem. The method of Algorithms for the Shortest Path, Assignment and Minimum

simplex is widely used to find the optimal solution. It Cost Flow Problems(1988).

applied to many areas of science, technology and

[9] Bazaraa, M. S., Jarvis, J. J., and Sherai, H. D., Linear

management. It has been prove that simplex mehod is Programming and Network Flows, 3rd Edition. John Wiley

use minimize the cost of transportation with limitation of and Sons, New York, NY(2005).

constraints. Transportation problem by general simplex

method is possible but very time consuming where as [10] Dantzig, G.B. , Application of the Simplex Method to a

Transportation Problem. In T.C. Koopmans (ed.). Activity

especial methods like SSM & MODI solves the problem Analysis of Productionand Allocation, John Wiley & Sons,

very easily but considering transportation problem as Inc (1951).

network flow problem and then solving it Network

Simplex algorithm is more convenient.

REFERENCES

College, Mapusa, Goa, India.'Two Square Determinant

Approach for Simplex Method'. IOSR Journal of

Mathematics (IOSR-JM)e-ISSN: 2278-5728, p-ISSN: 2319-

765X. Volume 11, Issue 5 Ver. IV (Sep. - Oct. 2015), PP 01-

04.

Civil Engineering, Presidency University, Gulshan-2,

Dhaka, Bangladesh'NETWORK SIMPLEX METHOD

USED TO TRANSPORTATION PROBLEM'American

International Journal of Research in Science, Technology,

Engineering & MathematicsAvailable online at

http://www.iasir.net ISSN (Print): 2328-3491, ISSN

(Online)

Statistics, Govt. Vidarbha Institute of Science &

Humanities, Amravati, INDIA 'A New Variant of Simplex

Method' nternational Journal of Engineering and

Management Research Volume-3, Issue-6, December-2013,

ISSN No.: 2250-0758.

Ismail and M. Kobraei'Use of the simplex method to

optimize analytical condition in structural analysis'

International Journal of Physical Sciences Vol. 6(4), pp.

691-697, 18 February, 2011 Available online at

http://www.academicjournals.org/IJPS ISSN 1992 - 1950

2011 Academic Journals

FOR WOLFES MODIFIED SIMPLEX METHOD TO

SOLVE QUADRATIC PROGRAMMING PROBLEMS

IJRET: International Journal of Research in Engineering

and Technology eISSN: 2319-1163 | pISSN: 2321-7308

Flows Theory, Algorithms,and Applications, Handbooks in

Operations Researchand Management Science, Prentice

hall, upper saddle river, New Jersey 07458, (1989), pp-

402-460.

55

- DualityUploaded bySuprabhat Tiwari
- JNTUA MBA Draft Syllabus 2014-15Uploaded byjagadeswar reddy
- Train Schedule Optimization in Public Rail TransportUploaded byMohamed El-Wakil
- Optimal Cost Design of Water Distribution NetworksUploaded byYoussef
- 11. Management-Application of Linear Programming-Dr Agarana, M.C.Uploaded byBESTJournals
- Goal ProgrammingUploaded byrajivkumar2oct
- IEOR4004-notes1Uploaded byPedro Carmona
- Operations Research SummaryUploaded byQuan Dang
- Chapter 6Uploaded byKaran Ramchandani
- Ship RoutingUploaded byManoj Kumar
- Stochastic Model Predictive ControlUploaded byikorishor amba
- Formulations for a Problem of Petroleum TransportationUploaded by1br4h1m0v1c
- Exercises NosolUploaded byDominiqueTame
- Week 1 OverviewUploaded byAleep YoungBae
- B Mollica Section003 SimplexMethod-RestaurantMenuOptimization (1)Uploaded byRamachandrarao Maddali
- LinearProgramming.docUploaded byMiluska Jara Pinto
- Block 4 MEC 003 Unit 12Uploaded byAbhishek Patra
- 7 ME F344 Engineering Optimization AKGuptaUploaded bySrikar Renikindhi
- LPP_2Uploaded byNikhil Mishra
- Two.Phase.Simplex.pdfUploaded byamo1123
- Parametric LPUploaded byAjay Kumar Agarwal
- Neutrosophic Linear Programming ProblemUploaded byAnonymous 0U9j6BLllB
- Using Temporal ProbabilisticUploaded byneeraj00715925
- aliman2013.pdfUploaded byAldiansyah Nasution
- 1 Linear Programming ProblemUploaded byBiswajit Routroy
- 14_B-031Uploaded bydjebin
- 10494Uploaded bySanjay Tiwari
- SHill.docUploaded byALBERTUS
- Neural networking models for optimization and linear programming.Uploaded byyajkr
- 2Uploaded byApam Benjamin

- A Survey on Jamming Attacks in Wireless Sensor NetworksUploaded byInternational Journal of Innovations in Engineering and Science
- Study of Supraharmonics and Its Reduction by Using Novel ControllerUploaded byInternational Journal of Innovations in Engineering and Science
- Seismic Analysis and Design of Multi-Storied RC Building Using STAAD Pro and ETABSUploaded byInternational Journal of Innovations in Engineering and Science
- 5G Challenges & ResearchUploaded byInternational Journal of Innovations in Engineering and Science
- Experimental Analysis of Self compacting Concrete (SCC) using Fly ash, Stone Dust and Silica FumesUploaded byInternational Journal of Innovations in Engineering and Science
- Design and Fabrication of Three Wheeler Drive Forklift for Industrial WarehousesUploaded byInternational Journal of Innovations in Engineering and Science
- Static Seismic Analysis of RCC Building as Per is 18932002 by Using STAAD-Pro SoftwareUploaded byInternational Journal of Innovations in Engineering and Science
- Study of Real-time Smart Traffic ControllerUploaded byInternational Journal of Innovations in Engineering and Science
- Safety Management in Coal Mining Industrial Output Transporting System (Haul Roads, Benches Heights, Widths and Slope) for Effective ProductionUploaded byInternational Journal of Innovations in Engineering and Science
- Intelligent Transportation System–Recent Trends in Transportation System a ReviewUploaded byInternational Journal of Innovations in Engineering and Science
- Analysis and Design of (G+100) Storied Building By Using SoftwareUploaded byInternational Journal of Innovations in Engineering and Science
- Mathematical Modeling and Analysis of Various Parameters Responsible for Gray Cast Iron DefectsUploaded byInternational Journal of Innovations in Engineering and Science
- Increasing Productivity Using 5 S Techniques in Small Scale IndustriesUploaded byInternational Journal of Innovations in Engineering and Science
- Dynamic Seismic Analysis of RCC Building as Per is 18932002 by Using STAAD-Pro SoftwareUploaded byInternational Journal of Innovations in Engineering and Science
- Fabrication of Hand Motion Control End EffectorUploaded byInternational Journal of Innovations in Engineering and Science
- Evaluation of Part Production Methodology in Automotive IndustryUploaded byInternational Journal of Innovations in Engineering and Science
- An Experimental Study on Flexural Behaviour of Reinforced Concrete Beam Strengthened With FRP CompositesUploaded byInternational Journal of Innovations in Engineering and Science
- Design and Analysis of Go-kart ChassisUploaded byInternational Journal of Innovations in Engineering and Science
- Design & Analysis of Multi-part Fixture for Pin Quadrant of Quadrant Sub-Assembly of CultivatorUploaded byInternational Journal of Innovations in Engineering and Science
- Customer Satisfaction Analysis in Four Wheeler Service CentreUploaded byInternational Journal of Innovations in Engineering and Science
- Computer Aided Analysis of Vibration in Machine Tool and Design of Damping SystemUploaded byInternational Journal of Innovations in Engineering and Science
- An Experimental Study on ShearBehaviour of Reinforced Concrete Beam Strengthened With FRP CompositesUploaded byInternational Journal of Innovations in Engineering and Science
- Survey on Automatic Solar Tracking SystemUploaded byInternational Journal of Innovations in Engineering and Science
- Steer the Sphere Navigate the Location Nearby Using Augmented RealityUploaded byInternational Journal of Innovations in Engineering and Science
- Smart Trolley in Shopping MallUploaded byInternational Journal of Innovations in Engineering and Science
- Smart Ration Card System Using RFIDUploaded byInternational Journal of Innovations in Engineering and Science
- Sustainability Assessment for Road Project UsingUploaded byInternational Journal of Innovations in Engineering and Science
- NavigoUploaded byInternational Journal of Innovations in Engineering and Science
- Remote Sensing and Geographic Information System Based Route Planning ReviewUploaded byInternational Journal of Innovations in Engineering and Science
- Sentiment Analysis of Product ReviewUploaded byInternational Journal of Innovations in Engineering and Science

- 09_MBAUploaded bymohd shoaib
- issyll6Uploaded byBradley Garcia
- 889428 20150513191631 Download CA Final Costing Guideline Answers May 2015Uploaded byjonnajon92-1
- LP07 Big M FormulationUploaded bytemitourpe
- instruction manual for operational researchUploaded byEkta
- MB0032 - P.Srinath - Completely SolvedUploaded bySrinath
- Application of a Dual Simplex method to Transportation Problem to minimize the costUploaded byInternational Journal of Innovations in Engineering and Science
- lecture_notes_series_optimisation_constrained.pdfUploaded bysalim
- Optimization in Practice with MATLAB® For Engineering Students and ProfessionalsUploaded bySiddhant Brahmbhatt
- UNIT 4 OPERATIONS RESEARCHUploaded bykeerthi_sm18
- ATT_KORBXUploaded byAshish Sharma
- Linear ProgrammingUploaded byAdesy Mayang Sari
- Cutting Stock Problem Solution BehaviorsUploaded byPrathap Sankar
- 5-LP Simplex (Cj-Zj Tableau)Uploaded byRizal Ahmad
- ALOUploaded byAchal Chox
- LESSON 2 Simplex MethodUploaded byMichelle Anne Constantino
- [Dimitris Bertsimas, John N. Tsitsiklis, Dimitris (BookFi)Uploaded byPriscila Gutierres
- MCA_Syllabus_2011.docUploaded byArka Prava Paul
- Tutorial Sheet 2 optimizationUploaded bySivasai Kumar
- bender.pdfUploaded byGirish Raguvir
- 2006-2009 Batch(CU5MA).docUploaded byRobertBellarmine
- Gradient Search by Newton39s MethodUploaded byFrancisco
- PGDM EBIZ - 2010 - 12 & 2011 - 13 Batches - SyllabusUploaded byPriyank Piyush
- MMS 1st Year Syllabus - (4)Uploaded byaryabhatmaths
- Chvátal - Linear ProgrammingUploaded byghclemente
- Mathematics SyllabusUploaded byHiya Potter
- IpMGT613Uploaded byShivani Sharma
- LPP Project - Profit Maximization Through Optimization TechniqueUploaded byMonish Ansari
- Search Methods for Finding Nash Equilibrium_paperUploaded bywalrod22
- AVU - Linear ProgrammingUploaded bycantor2000