Handling Indivisibilities. Notes for AGEC 622. Bruce McCarl Regents Professor of Agricultural Economics Texas A&M University
|
|
- Deirdre Harrington
- 5 years ago
- Views:
Transcription
1 Notes for AGEC 6 Bruce McCarl Regents Professor of Agricultural Econoics Texas A&M University
2 All or None -- Integer Prograing McCarl and Spreen Chapter 5 Many investent and probles involve cases where one has to tae all or none of an ite. We cannot build ½ of a plant or buy 3/4 of a achine. We build or or 3 or none but not a fractional part This leads to integer prograing ax s. t. C A W W W C A C W is a noral,continuous LP variable, is an integer variable, is a zero one variable A 3 3 b 0 0 and int eger equals 0 or When probles have only they are called pure integer only they are called pure zero one W and they are called ixed integer other variants exist
3 Logical Conditions -- Integer Prograing Integer prograing also allows logical conditions to be iposed. Suppose I a odeling a bottling plant that runs white il but can run chocolate. If they run any chocolate they encounter cleaning cost of F. Let be aount of chocolate il processed. Then add odel coponent ax C F s. t. M 0 0 equals 0or Note in this coponent M is a big nuber (0 billion) and for >0 this iplies = while if F>0 =0 if =0. So if we run any chocolate il we clean whether it be gallon or one illion. is an indicator variable. 3
4 Integer Prograing Suppose we can buy fro different types of achines and get fro the capacity for the ith tie period ax C F s. t. a i CAP i equals 0 0 for for all all 0 or for In this case if they were utually exclusive we could also add or if buying one eant we ust buy another - =0 or if a achine can only be purchased if we have a iniu volue a LL for all i = i i 0 i all 4
5 Integer Prograing Solution Difficulty All sounds good but probles are hard. Let s explore why Calculus is basis of all continuous optiization but not here because there is no neighborhood around a point in which a derivative can be defined 3 3, 6 6 0& integer Feasible Region for, nonnegative integers 0 Figure 5. Graph of Feasible Integer Points for First LP Proble 8 6 -Axis Axis 5
6 Integer Prograing Solution Difficulty 0 Figure 5. Graph of Feasible Integer Points for First LP Proble 8 6 -Axis 4 Note Axis. Solutions are finite. A line between feasible points does not contain all feasible points 3. Moving between points is not always easy 4. Points are on boundary, interior and not in general at corners 5. Rounding of LP point ay not be bad 6
7 Integer Prograing Solution Difficulty Consider 7 0, &int eger Figure 5. Graph of Feasible Integer Points for Second Integer Proble Here Rounding not good and Moveent between points hard 7
8 Integer Prograing Solution Difficulty Mixed Integer Prograing Feasible Region integer, continuous 3 3, & int eger 0 Figure 5.3 Mixed Integer Feasible Region
9 Integer Prograing Solution Rounding Solving the proble Max s. t , & int eger as an LP yields ==3. Ob=7.68 which can be rounded to ==3, Ob=7. But this ay not always be feasible or optial In this case an obective of 7.6 arises at =4,= (solint.gs) Rounding only wors well if variable values are large 9
10 Integer Prograing Solution -- Branch and Bound Solving Max s. t as an LP yields ==3. ob=7.68, & int eger We can generate related probles that collectively do not exclude integer variables as follows ax.4 ax.4 Prob A 3 6 or Prob B & int eger & int eger Suppose we solveprob A we get x=3.x=3.33 and again generate ore probles the first with x#3 and the other with x 4. Solving these yields an integer solution at x=x=3 ob=7. and another at x=,x=4 ob=6.8. But optiat solution is x=4,x=, ob=7.6 fro proble B above 0
11 Integer Prograing Solution -- Branch and Bound Now since we are axiizing we choose the 7. as the best solution and call it the incubent. But it is not necessarily optial (in fact it is not at all). To verify its optiality we need to go bac and investigate the probles we have not yet solved which still have the potential of having an obective function above our current best (7.). We would then go bac to the right hand proble fro the first setup and eventually find =4,=, Ob=7.6. The above reveals the basic nature of branch and bound. It begins by solving an LP then finds a variable that is not integer and generates probles (creating a branch). It then solves one of these and continues until it finds an integer solution which establishes a bound. We then bactrac and try to eliinate all other possible branches either by finding they cannot have a better obective than the incubent (the bounding step) or are infeasible. This eans interediate solutions are found and we converge to within a tolerance
12 Integer Prograing Solution in ECEL Integer prograing probles can be solved with Excel. To do this one adds a constraint restricting the variables to tae on integer values. This constraint is iposed as one adds any other constraints. Naely a variable is chosen with the inquality iposed as one of the last two choices. This is portrayed in the following screenshot. Naely choosing int restricts the variables to integer values and Bin is chosen to restrict variables to binary or 0- values.
13 Integer Prograing Solution in ECEL Unfortunately the default Excel solver does not reliably get the proper solution for integer prograing probles unless you set soe options Naely when you call up the solver go into the options box. Then chec that you are to assue a linear odel and set the tolerance saller. 3
14 Integer Prograing Solution in ECEL In addition, students should realize that ECEL is not an extraordinarily good choice for the solution of large linear, integer, or nonlinear prograing probles and software lie GAMS ay be better in a professional setting. Excel was taught in this class so as to not require students to learn ultiple and initially unfailiar software pacages One can buy iproved plug-ins by looing on the Internet and purchasing an upgraded solver which has this capability. For exaple, a Google search for the words excel in solver integer turns up a nuber of choices. 4
15 McCarl and Spreen Chapter 6 Integer Prograing Solution -- Knapsac The napsac proble is a faous IP forulation. Suppose a hier selects the ost valuable ites to carry, subect to a weight or capacity liit. Partial ites are not allowed, thus choices are depicted by zero-one variables. The general proble forulation assuing only one of each ite is available is Max v s.t. d = W 0or for all The decision variables indicate whether the th alternative ite is chosen. Each ite is worth v. The obective function gives total value of ites chosen. The capacity used by each is d. The constraint requires total capacity use to be less than or equal to the capacity liit (W). 5
16 Integer Prograing Solution -- Knapsac Suppose an individual is preparing to ove. Assue a truc is available that can hold at ost 50 cubic feet of ites. Suppose there are 0 ites which can be taen and that their naes, volues and values iplicit below. The resultant forulation is Max s.t. 7x 70x x 5x 0x = 0 x 0x or 3 3, x 0x for 4 4 all 5x 5x 5 5 x 5x 6 6 5x 0x 7 7 x 5x 8 8 5x 9 0x 9 0x 0x The optial obective function value equals 8. The solution indicates that all ites except furniture, 7, should be taen. There are peculiarities which should be noted. First, the constraint has 65 units in slac (50-85) and no shadow price. However, for practical purposes the constraint does have a shadow price as the 7 variable would coe into the solution if there were 0 ore units of capacity, but slac is only 65. Further, note that each of the variables has a non-zero reduced cost. This is because bounds have been added. Shadow price and red cost are isleading. 6
17 Warehouse Location McCarl and Spreen Chapter 6 Warehouse location probles involve location of warehouses within a transportation syste so as to iniize overall costs. Basic decision involves tradeoffs between fixed warehouse construction costs and transportation costs. z i Supply point x i Warehouse y Deand Point v Supply point Warehouse Deand Point Supply point i Warehouse Deand Point 7
18 Warehouse Location Min s.t. F CAP V V Ci i i i i i D E i i i Z Z Z i i i S D i 0 0 for alli for all for all for all A V b for all V = 0or, i,, Z i 0 for alli,, Merges Fixed Charge - Capacity and Transportation Proble with transshipents. We consider oving goods fro supply i to deand or fro i to warehouse and then on to deand. 8
19 Warehouse Location V A V B V C A B C A B C A A B B C C Z Z Z Z Min V A, V B, V C (0,) x i,, Z i 0 for all i,, 9
20 Warehouse Location Variable Value Reduced Cost Row Activity Shadow Price V A V B V C A B C A B C A A B 0 0 B C 0 0 C
21 Machinery Selection McCarl and Spreen Chapter 6 The achinery selection proble is a coon investent proble. In this proble one axiizes profits, trading off the annual costs of achinery purchase with the extra profits obtained by having that achinery. A general forulation of this proble is Max s.t. F Cap G i r is a C J A D n i nonnegative integer, 0 b e n r 0 for alli and for alln for allr for all,,and The decision variables are, the integer nuber of units of the th type achinery purchased;, the quantity of the th activity produced using the th achinery alternative. The paraeters of the odel are: F, the annualized fixed cost of the th achinery type; Cap i, the annual capacity of the th achinery type to supply the i th resource; G r, the usage of the r th achinery restriction when purchasing the th achinery type; C, the per unit net profit of ; A i, the per unit use by of the i th capacity resource supplied by purchasing achine ; D n, the per unit usage of fixed resources of the n th type by ; b n, the endowent of the n th resource in the year being odeled; and e r, the endowent of the r th achinery restriction.
22 Machinery Selection Machinery Use Continuous Variables Plow with Tractor Plow with Tractor Plant Disc 8 Harvest with and Plow and Plow and Plow ans Plow Tractor Tractor Tractor Tractor Machinery Acquisition Integer Variables in Period in Period Planter Planter Harvester Harvester Tractor Plow Planter Disc Harvester Crop Sales Input Purchases Obectives (ax) Tractor Capacity in Period Tractor Capacity in Period Plow Capacity in Period Plow Capacity in Period Capacity of Planter Capacity of Disc Capacity of Har- vester Labor Available in Period Plow-Plant Sequencing Plant-Harvest Sequencing Land Available 600 Planters Discs Lin Disc- Planter ield Balance Input Balance - 0
23 Table 6.7. Solution for the Machinery Selection Proble ob = 6,00 Variable Value Reduced Cost Equation Slac Shadow Price Buy Tractor -5,000 Tractor capacity in Period 00 0 Buy Tractor 0 0 Tractor capacity in Period 30 0 Buy Plow 0 0 Tractor capacity in Period Buy Plow -,00 Tractor capacity in Period 0 Buy Planter 0 0 Tractor capactiy in Period Buy Planter Tractor capacity in Period Buy Disc 0 0 Plow capacity in Period Buy Disc 0 Plow capacity in Period 0 0 Buy Harvester 0 0 Plow capacity in Period 00 0 Buy Harvestor 0 Plow capacity in Period 80 0 Plow with Tractor and Plow in Period Planter capacity 0 0 Plow with Tractor and Plow in Period Planter capacity 30 0 Plow with Tractor and Plow in Period Disc 0 0 Plow with Tractor and Plow in Period 0 0 Disc 30 0 Plow with Tractor and Plow in Period Harvester 0 50 Plow with Tractor and Plow in Period Harvester 50 0 Plow with Tractor and Plow in Period 0 0 Labor available in Period 8 0 Plow with Tractor and Plow in Period Labor available in Period 44 0 Plant with Tractor and Planter Labor available in Period Plant with Tractor and Planter Plow Plant Plant with Tractor and Planter Plant Harvester Plant with Tractor and Planter 0 0 Land Harvest with Tractor and Harvester One Planter 0 0 Harvest with Tractor and Harvester One Disc 0 0 Harvest with Tractor and Harvester Planter to Disc 0 0 Harvest with Tractor and Harvester Planter to Disc 0 0 Sell Crop 84,000 0 ield Balance 0.5 Purchase Inputs Input Balance 0 0
Introduction. Chapter 15. Optimization Modeling: Applications. Integer Programming. Manufacturing Example. Three Types of ILP Models
Chapter 5 Optimization Modeling: Applications Integer Programming Introduction When one or more variables in an LP problem must assume an integer value we have an Integer Linear Programming (ILP) problem.
More informationA Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network
A Bea Search Method to Solve the Proble of Assignent Cells to Switches in a Cellular Mobile Networ Cassilda Maria Ribeiro Faculdade de Engenharia de Guaratinguetá - DMA UNESP - São Paulo State University
More informationClustering. Cluster Analysis of Microarray Data. Microarray Data for Clustering. Data for Clustering
Clustering Cluster Analysis of Microarray Data 4/3/009 Copyright 009 Dan Nettleton Group obects that are siilar to one another together in a cluster. Separate obects that are dissiilar fro each other into
More informationUtility-Based Resource Allocation for Mixed Traffic in Wireless Networks
IEEE IFOCO 2 International Workshop on Future edia etworks and IP-based TV Utility-Based Resource Allocation for ixed Traffic in Wireless etworks Li Chen, Bin Wang, Xiaohang Chen, Xin Zhang, and Dacheng
More informationThe optimization design of microphone array layout for wideband noise sources
PROCEEDINGS of the 22 nd International Congress on Acoustics Acoustic Array Systes: Paper ICA2016-903 The optiization design of icrophone array layout for wideband noise sources Pengxiao Teng (a), Jun
More informationIdentifying Converging Pairs of Nodes on a Budget
Identifying Converging Pairs of Nodes on a Budget Konstantina Lazaridou Departent of Inforatics Aristotle University, Thessaloniki, Greece konlaznik@csd.auth.gr Evaggelia Pitoura Coputer Science and Engineering
More informationFair Resource Allocation for Heterogeneous Tasks
Fair Resource Allocation for Heterogeneous Tasks Koyel Mukherjee, Partha utta, Gurulingesh Raravi, Thangaraj Balasubraania, Koustuv asgupta, Atul Singh Xerox Research Center India, Bangalore, India 560105
More informationStructural Balance in Networks. An Optimizational Approach. Andrej Mrvar. Faculty of Social Sciences. University of Ljubljana. Kardeljeva pl.
Structural Balance in Networks An Optiizational Approach Andrej Mrvar Faculty of Social Sciences University of Ljubljana Kardeljeva pl. 5 61109 Ljubljana March 23 1994 Contents 1 Balanced and clusterable
More informationThe Application of Bandwidth Optimization Technique in SLA Negotiation Process
The Application of Bandwidth Optiization Technique in SLA egotiation Process Srećko Krile University of Dubrovnik Departent of Electrical Engineering and Coputing Cira Carica 4, 20000 Dubrovnik, Croatia
More informationA Low-Cost Multi-Failure Resilient Replication Scheme for High Data Availability in Cloud Storage
216 IEEE 23rd International Conference on High Perforance Coputing A Low-Cost Multi-Failure Resilient Replication Schee for High Data Availability in Cloud Storage Jinwei Liu* and Haiying Shen *Departent
More informationEnergy Efficient Design Strategies of Translucent and Transparent IP Over WDM Networks
Energy Efficient Design Strategies of Translucent and Transparent IP Over WDM Networs F. Mousavi Madani Departent of coputer engineering Alzahra University Tehran, Iran, osavif@alzahra.ac.ir Received:
More informationEE 364B Convex Optimization An ADMM Solution to the Sparse Coding Problem. Sonia Bhaskar, Will Zou Final Project Spring 2011
EE 364B Convex Optiization An ADMM Solution to the Sparse Coding Proble Sonia Bhaskar, Will Zou Final Project Spring 20 I. INTRODUCTION For our project, we apply the ethod of the alternating direction
More informationSurvivability Function A Measure of Disaster-Based Routing Performance
Survivability Function A Measure of Disaster-Based Routing Perforance Journal Club Presentation on W. Molisz. Survivability function-a easure of disaster-based routing perforance. IEEE Journal on Selected
More informationFinding Optimal Allocation of Constrained Cloud Capacity Using Hyperbolic Voronoi Diagrams on the Sphere
Intelligent Inforation Manageent 4 9-5 http://dxdoiorg/46/ii455 Published Online October (http://wwwciporg/ournal/ii) Finding Optial Allocation of Constrained Cloud Capacity Using Hyperbolic Voronoi Diagras
More informationPrepared By. Handaru Jati, Ph.D. Universitas Negeri Yogyakarta.
Prepared By Handaru Jati, Ph.D Universitas Negeri Yogyakarta handaru@uny.ac.id Chapter 8 Using The Excel Solver To Solve Mathematical Programs Chapter Overview 8.1 Introduction 8.2 Formulating Mathematical
More informationTheoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem
Theoretical Analysis of Local Search and Siple Evolutionary Algoriths for the Generalized Travelling Salesperson Proble Mojgan Pourhassan ojgan.pourhassan@adelaide.edu.au Optiisation and Logistics, The
More informationMultipath Selection and Channel Assignment in Wireless Mesh Networks
Multipath Selection and Channel Assignent in Wireless Mesh Networs Soo-young Jang and Chae Y. Lee Dept. of Industrial and Systes Engineering, KAIST, 373-1 Kusung-dong, Taejon, Korea Tel: +82-42-350-5916,
More informationCS 361 Meeting 8 9/24/18
CS 36 Meeting 8 9/4/8 Announceents. Hoework 3 due Friday. Review. The closure properties of regular languages provide a way to describe regular languages by building the out of sipler regular languages
More informationShortest Path Determination in a Wireless Packet Switch Network System in University of Calabar Using a Modified Dijkstra s Algorithm
International Journal of Engineering and Technical Research (IJETR) ISSN: 31-869 (O) 454-4698 (P), Volue-5, Issue-1, May 16 Shortest Path Deterination in a Wireless Packet Switch Network Syste in University
More informationGeo-activity Recommendations by using Improved Feature Combination
Geo-activity Recoendations by using Iproved Feature Cobination Masoud Sattari Middle East Technical University Ankara, Turkey e76326@ceng.etu.edu.tr Murat Manguoglu Middle East Technical University Ankara,
More informationEvaluation of the Timing Properties of Two Control Networks: CAN and PROFIBUS
Evaluation of the Tiing Properties of Two Control Networs: CAN and PROFIBUS Max Mauro Dias Santos 1, Marcelo Ricardo Steer 2 and Francisco Vasques 3 1 UnilesteMG, CEP 35170-056, Coronel Fabriciano MG Brasil.
More informationTwo hours UNIVERSITY OF MANCHESTER. January Answer any THREE questions. Answer each question in a separate book
Two hours UNIVERSITY OF MANCHESTER Database Architecture Models and Design January 2004 Answer any THREE questions Answer each question in a separate book The use of electronic calculators is not peritted.
More informationMedical Biophysics 302E/335G/ st1-07 page 1
Medical Biophysics 302E/335G/500 20070109 st1-07 page 1 STEREOLOGICAL METHODS - CONCEPTS Upon copletion of this lesson, the student should be able to: -define the ter stereology -distinguish between quantitative
More informationA Distributed Multi-service Resource Allocation Algorithm in Heterogeneous Wireless Access Medium
1 A Distributed Multi-service Resource Allocation Algorith in Heterogeneous Wireless Access Mediu Muhaad Isail, Student Meber, IEEE, and Weihua Zhuang, Fellow, IEEE Abstract In this paper, radio resource
More informationA Comparative Study of Two-phase Heuristic Approaches to General Job Shop Scheduling Problem
IE Vol. 7, No. 2, pp. 84-92, Septeber 2008. A Coparative Study of Two-phase Heuristic Approaches to General Job Shop Scheduling Proble Ji Ung Sun School of Industrial and Managent Engineering Hankuk University
More informationColorado School of Mines. Computer Vision. Professor William Hoff Dept of Electrical Engineering &Computer Science.
Professor Willia Hoff Dept of Electrical Engineering &Coputer Science http://inside.ines.edu/~whoff/ 1 Caera Calibration 2 Caera Calibration Needed for ost achine vision and photograetry tasks (object
More informationCollaborative Web Caching Based on Proxy Affinities
Collaborative Web Caching Based on Proxy Affinities Jiong Yang T J Watson Research Center IBM jiyang@usibco Wei Wang T J Watson Research Center IBM ww1@usibco Richard Muntz Coputer Science Departent UCLA
More informationDatabase Design on Mechanical Equipment Operation Management System Zheng Qiu1, Wu kaiyuan1, Wu Chengyan1, Liu Lei2
2nd International Conference on Advances in Mechanical Engineering and Industrial Inforatics (AMEII 206) Database Design on Mechanical Equipent Manageent Syste Zheng Qiu, Wu kaiyuan, Wu Chengyan, Liu Lei2
More informationCOMPARISON OF ANT COLONY OPTIMIZATION & PARTICLE SWARM OPTIMIZATION IN GRID ENVIRONMENT
COMPARISON OF ANT COLONY OPTIMIZATION & PARTICLE SWARM OPTIMIZATION IN GRID ENVIRONMENT B.BOOBA 1 Dr. T.V.GOPAL 2 1 Research Scholar, Assist. Professor(Sl.Gr),Departent of Coputer Applications, Easwari
More informationAn Efficient Approach for Content Delivery in Overlay Networks
An Efficient Approach for Content Delivery in Overlay Networks Mohaad Malli, Chadi Barakat, Walid Dabbous Projet Planète, INRIA-Sophia Antipolis, France E-ail:{alli, cbarakat, dabbous}@sophia.inria.fr
More informationTrees. Linear vs. Branching CSE 143. Branching Structures in CS. What s in a Node? A Tree. [Chapter 10]
CSE 143 Trees [Chapter 10] Linear vs. Branching Our data structures so far are linear Have a beginning and an end Everything falls in order between the ends Arrays, lined lists, queues, stacs, priority
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 5.05 Introduction to Optimization (Spring 005) Problem Set 8, Due April 4, 005 You will need 4.5 points out of 5 to receive a grade of.5.. Integer Programming and
More informationPredicting x86 Program Runtime for Intel Processor
Predicting x86 Progra Runtie for Intel Processor Behra Mistree, Haidreza Haki Javadi, Oid Mashayekhi Stanford University bistree,hrhaki,oid@stanford.edu 1 Introduction Progras can be equivalent: given
More informationNOTATION AND TERMINOLOGY
15.053x, Optimization Methods in Business Analytics Fall, 2016 October 4, 2016 A glossary of notation and terms used in 15.053x Weeks 1, 2, 3, 4 and 5. (The most recent week's terms are in blue). NOTATION
More informationLesson 08 Linear Programming
Lesson 08 Linear Programming A mathematical approach to determine optimal (maximum or minimum) solutions to problems which involve restrictions on the variables involved. 08 - Linear Programming Applications
More informationUsing Imperialist Competitive Algorithm in Optimization of Nonlinear Multiple Responses
International Journal of Industrial Engineering & Production Research Septeber 03, Volue 4, Nuber 3 pp. 9-35 ISSN: 008-4889 http://ijiepr.iust.ac.ir/ Using Iperialist Copetitive Algorith in Optiization
More informationAN HEURISTIC ALTERNATIVE TO OPTIMIZE MAKESPAN OVER M PARALLEL MACHINES WITH RELEASE AND SECUENCE-DEPENDENT SETUP TIMES P m r j, s jk C max
AN HEURISTIC ALTERNATIVE TO OTIMIZE MAKESAN OVER M ARALLEL MACHINES WITH RELEASE AND SECUENCE-DEENDENT SETU TIMES r j, s j C ax LOEZ, ulián, ROZO, Viviana, SAAVEDRA, Iván and ATERNINA-ARBOLEDA, Carlos
More informationChapter II. Linear Programming
1 Chapter II Linear Programming 1. Introduction 2. Simplex Method 3. Duality Theory 4. Optimality Conditions 5. Applications (QP & SLP) 6. Sensitivity Analysis 7. Interior Point Methods 1 INTRODUCTION
More informationOPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS
Key words SOA, optial, coplex service, coposition, Quality of Service Piotr RYGIELSKI*, Paweł ŚWIĄTEK* OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS One of the ost iportant tasks in service oriented
More informationOblivious Routing for Fat-Tree Based System Area Networks with Uncertain Traffic Demands
Oblivious Routing for Fat-Tree Based Syste Area Networks with Uncertain Traffic Deands Xin Yuan Wickus Nienaber Zhenhai Duan Departent of Coputer Science Florida State University Tallahassee, FL 3306 {xyuan,nienaber,duan}@cs.fsu.edu
More informationInvestigation of The Time-Offset-Based QoS Support with Optical Burst Switching in WDM Networks
Investigation of The Tie-Offset-Based QoS Support with Optical Burst Switching in WDM Networks Pingyi Fan, Chongxi Feng,Yichao Wang, Ning Ge State Key Laboratory on Microwave and Digital Counications,
More informationChapter 7. Linear Programming Models: Graphical and Computer Methods
Chapter 7 Linear Programming Models: Graphical and Computer Methods To accompany Quantitative Analysis for Management, Eleventh Edition, by Render, Stair, and Hanna Power Point slides created by Brian
More informationThe research on end-effector position and orientation error distribution of SCARA industrial robot
International Journal of Research in Engineering and Science (IJRES) ISSN (Online): 2320-9364, ISSN (Print): 2320-9356 Volue 3 Issue 6 ǁ June 2015 ǁ PP.13-20 The research on end-effector position and orientation
More informationModeling Parallel Applications Performance on Heterogeneous Systems
Modeling Parallel Applications Perforance on Heterogeneous Systes Jaeela Al-Jaroodi, Nader Mohaed, Hong Jiang and David Swanson Departent of Coputer Science and Engineering University of Nebraska Lincoln
More informationDefining and Surveying Wireless Link Virtualization and Wireless Network Virtualization
1 Defining and Surveying Wireless Link Virtualization and Wireless Network Virtualization Jonathan van de Belt, Haed Ahadi, and Linda E. Doyle The Centre for Future Networks and Counications - CONNECT,
More informationIntroduction to Management Science (8th Edition, Bernard W. Taylor III) Chapter 9 Integer Programming. Chapter 9 - Integer Programming 1
Introduction to Management Science (8th Edition, Bernard W. Taylor III) Chapter 9 Integer Programming Chapter 9 - Integer Programming 1 Chapter Topics Integer Programming (IP) Models Still linear programming
More informationSmarter Balanced Assessment Consortium Claims, Targets, and Standard Alignment for Math
Sarter Balanced Assessent Consortiu s, s, Stard Alignent for Math The Sarter Balanced Assessent Consortiu (SBAC) has created a hierarchy coprised of clais targets that together can be used to ake stateents
More informationEfficient Estimation of Inclusion Coefficient using HyperLogLog Sketches
Efficient Estiation of Inclusion Coefficient using HyperLogLog Sketches Azade Nazi, Bolin Ding, Vivek Narasayya, Surajit Chaudhuri Microsoft Research {aznazi, bolind, viveknar, surajitc}@icrosoft.co ABSTRACT
More informationMinimax Sensor Location in the Plane
NSF GRANT #040040 NSF PROGRAM NAME: Operations Research Miniax Sensor Location in the Plane To M. Cavalier The Pennsylvania State University University Par, PA 680 Enrique del Castillo The Pennsylvania
More informationPERFORMANCE MEASURES FOR INTERNET SERVER BY USING M/M/m QUEUEING MODEL
IJRET: International Journal of Research in Engineering and Technology ISSN: 239-63 PERFORMANCE MEASURES FOR INTERNET SERVER BY USING M/M/ QUEUEING MODEL Raghunath Y. T. N. V, A. S. Sravani 2 Assistant
More informationDesign Optimization of Mixed Time/Event-Triggered Distributed Embedded Systems
Design Optiization of Mixed Tie/Event-Triggered Distributed Ebedded Systes Traian Pop, Petru Eles, Zebo Peng Dept. of Coputer and Inforation Science, Linköping University {trapo, petel, zebpe}@ida.liu.se
More informationGeometric Constraint Solver using Multivariate Rational Spline Functions
Geoetric onstraint Solver using Multivariate ational Spline Functions Gershon Elber Departent of oputer Science Technion srael nstitute of Technology Haifa 3000 srael E-ail: gershon@cstechnionacil Myung-Soo
More informationTHE rapid growth and continuous change of the real
IEEE TRANSACTIONS ON SERVICES COMPUTING, VOL. 8, NO. 1, JANUARY/FEBRUARY 2015 47 Designing High Perforance Web-Based Coputing Services to Proote Teleedicine Database Manageent Syste Isail Hababeh, Issa
More information6.1 Topological relations between two simple geometric objects
Chapter 5 proposed a spatial odel to represent the spatial extent of objects in urban areas. The purpose of the odel, as was clarified in Chapter 3, is ultifunctional, i.e. it has to be capable of supplying
More informationIntroduction to Linear Programming. Algorithmic and Geometric Foundations of Optimization
Introduction to Linear Programming Algorithmic and Geometric Foundations of Optimization Optimization and Linear Programming Mathematical programming is a class of methods for solving problems which ask
More informationA Fast Multi-Objective Genetic Algorithm for Hardware-Software Partitioning In Embedded System Design
A Fast Multi-Obective Genetic Algorith for Hardware-Software Partitioning In Ebedded Syste Design 1 M.Jagadeeswari, 2 M.C.Bhuvaneswari 1 Research Scholar, P.S.G College of Technology, Coibatore, India
More informationSmarter Balanced Assessment Consortium Claims, Targets, and Standard Alignment for Math
Sarter Balanced Assessent Consortiu s, s, Stard Alignent for Math The Sarter Balanced Assessent Consortiu (SBAC) has created a hierarchy coprised of clais targets that together can be used to ake stateents
More informationKnowledge Discovery Applied to Agriculture Economy Planning
Knowledge Discovery Applied to Agriculture Econoy Planning Bing-ru Yang and Shao-un Huang Inforation Engineering School University of Science and Technology, Beiing, China, 100083 Eail: bingru.yang@b.col.co.cn
More informationQuerying Uncertain Data with Aggregate Constraints
Querying Uncertain Data with Aggregate Constraints Mohan Yang 1,2, Haixun Wang 1, Haiquan Chen 3, Wei-Shinn Ku 3 1 Microsoft Research Asia, Beijing, China 2 Shanghai Jiao Tong University, Shanghai, China
More informationGrading Results Total 100
University of California, Berkeley College of Engineering Departent of Electrical Engineering and Coputer Sciences Fall 2003 Instructor: Dave Patterson 2003-11-19 v1.9 CS 152 Exa #2 Solutions Personal
More informationChapter 9: Integer Programming
Chapter 9: Integer Programming ١ Learning Objectives (see p. 382) After completing this chapter, you should be able to: How Integer Programming (IP) differs from LP Describe how general IP problems arise
More informationDesigning High Performance Web-Based Computing Services to Promote Telemedicine Database Management System
Designing High Perforance Web-Based Coputing Services to Proote Teleedicine Database Manageent Syste Isail Hababeh 1, Issa Khalil 2, and Abdallah Khreishah 3 1: Coputer Engineering & Inforation Technology,
More informationA Generic Architecture for Programmable Trac. Shaper for High Speed Networks. Krishnan K. Kailas y Ashok K. Agrawala z. fkrish,
A Generic Architecture for Prograable Trac Shaper for High Speed Networks Krishnan K. Kailas y Ashok K. Agrawala z fkrish, agrawalag@cs.ud.edu y Departent of Electrical Engineering z Departent of Coputer
More informationUnit.9 Integer Programming
Unit.9 Integer Programming Xiaoxi Li EMS & IAS, Wuhan University Dec. 22-29, 2016 (revised) Operations Research (Li, X.) Unit.9 Integer Programming Dec. 22-29, 2016 (revised) 1 / 58 Organization of this
More informationData & Knowledge Engineering
Data & Knowledge Engineering 7 (211) 17 187 Contents lists available at ScienceDirect Data & Knowledge Engineering journal hoepage: www.elsevier.co/locate/datak An approxiate duplicate eliination in RFID
More informationGromov-Hausdorff Distance Between Metric Graphs
Groov-Hausdorff Distance Between Metric Graphs Jiwon Choi St Mark s School January, 019 Abstract In this paper we study the Groov-Hausdorff distance between two etric graphs We copute the precise value
More informationEnhancing Real-Time CAN Communications by the Prioritization of Urgent Messages at the Outgoing Queue
Enhancing Real-Tie CAN Counications by the Prioritization of Urgent Messages at the Outgoing Queue ANTÓNIO J. PIRES (1), JOÃO P. SOUSA (), FRANCISCO VASQUES (3) 1,,3 Faculdade de Engenharia da Universidade
More informationContent-Centric Multicast Beamforming in Cache-Enabled Cloud Radio Access Networks
Content-Centric Multicast Beaforing in Cache-Enabled Cloud Radio Access Networks Hao Zhou, Meixia Tao, Erkai Chen, Wei Yu *Dept. of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China
More informationEfficient Constraint Evaluation Algorithms for Hierarchical Next-Best-View Planning
Efficient Constraint Evaluation Algoriths for Hierarchical Next-Best-View Planning Ko-Li Low National University of Singapore lowl@cop.nus.edu.sg Anselo Lastra University of North Carolina at Chapel Hill
More informationSolving the Damage Localization Problem in Structural Health Monitoring Using Techniques in Pattern Classification
Solving the Daage Localization Proble in Structural Health Monitoring Using Techniques in Pattern Classification CS 9 Final Project Due Dec. 4, 007 Hae Young Noh, Allen Cheung, Daxia Ge Introduction Structural
More informationInteger Programming. Xi Chen. Department of Management Science and Engineering International Business School Beijing Foreign Studies University
Integer Programming Xi Chen Department of Management Science and Engineering International Business School Beijing Foreign Studies University Xi Chen (chenxi0109@bfsu.edu.cn) Integer Programming 1 / 42
More informationCOLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL
COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL 1 Te-Wei Chiang ( 蔣德威 ), 2 Tienwei Tsai ( 蔡殿偉 ), 3 Jeng-Ping Lin ( 林正平 ) 1 Dept. of Accounting Inforation Systes, Chilee Institute
More informationBoosted Detection of Objects and Attributes
L M M Boosted Detection of Objects and Attributes Abstract We present a new fraework for detection of object and attributes in iages based on boosted cobination of priitive classifiers. The fraework directly
More informationIN many interactive multimedia streaming applications, such
840 IEEE TRANSACTIONS ON MULTIMEDIA, VOL. 8, NO. 5, MAY 06 A Geoetric Approach to Server Selection for Interactive Video Streaing Yaochen Hu, Student Meber, IEEE, DiNiu, Meber, IEEE, and Zongpeng Li, Senior
More informationMinimax Sensor Location to Monitor a Piecewise Linear Curve
NSF GRANT #040040 NSF PROGRAM NAME: Operations Research Miniax Sensor Location to Monitor a Piecewise Linear Curve To M. Cavalier The Pennsylvania State University University Par, PA 680 Whitney A. Conner
More informationQUERY ROUTING OPTIMIZATION IN SENSOR COMMUNICATION NETWORKS
QUERY ROUTING OPTIMIZATION IN SENSOR COMMUNICATION NETWORKS Guofei Jiang and George Cybenko Institute for Security Technology Studies and Thayer School of Engineering Dartouth College, Hanover NH 03755
More informationOn the Complexity of Optimal Routing and Content Caching in Heterogeneous Networks
On the Coplexity of Optial Routing and Content Caching in Heterogeneous Networks Mostafa Dehghan 1, Anand Seethara 2, Bo Jiang 1, Ting He 3, Theodoros Salonidis 3, Ji Kurose 1, Don Towsley 1, and Raesh
More informationComputer Aided Drafting, Design and Manufacturing Volume 26, Number 2, June 2016, Page 13
Coputer Aided Drafting, Design and Manufacturing Volue 26, uber 2, June 2016, Page 13 CADDM 3D reconstruction of coplex curved objects fro line drawings Sun Yanling, Dong Lijun Institute of Mechanical
More informationMulti-Objective Territory Design with Capacity & Geographic Constraints
International Journal of Cobinatorial Optiization Probles and Inforatics, Vol. 1, No. 1, May-Aug 2010, pp. 3-12. ISSN: 2007-1558. Multi-Objective Territory Design with Capacity & Geographic Constraints
More informationDEBARRED OBJECTS RECOGNITION BY PFL OPERATOR
DEBARRED OBJECTS RECOGNITION BY PFL OPERATOR Manish Kuar Srivastava,Madan Kushwah, Abhishe uar 3 Assistant Professor, Departent of CSE, Lal Bahadur Shastri Group of Institutions Lucnow, Uttar Pradesh,
More informationResource Allocation (p. 254)
Linear Optimization 4.2 120 Resource Allocation (p. 254) Determine the linear program corresponding to the following problem. A farmer has set aside 18 acres of land to be used entirely for plots of grapes,
More informationDifferent criteria of dynamic routing
Procedia Coputer Science Volue 66, 2015, Pages 166 173 YSC 2015. 4th International Young Scientists Conference on Coputational Science Different criteria of dynaic routing Kurochkin 1*, Grinberg 1 1 Kharkevich
More information3.1 Graphing Using the First Derivative
3.1 Graphing Using the First Derivative Hartfield MATH 2040 Unit 3 Page 1 Recall that a derivative indicates the instantaneous rate of change at an x-value (or other input value) which is related to the
More informationUsing the Graphical Method to Solve Linear Programs J. Reeb and S. Leavengood
PERFORMANCE EXCELLENCE IN THE WOOD PRODUCTS INDUSTRY EM 8719-E October 1998 $2.50 Using the Graphical Method to Solve Linear Programs J. Reeb and S. Leavengood A key problem faced by managers is how to
More informationMinimum Delay Stream Routing and Content Caching in Hybrid Coalition Networks
Miniu Delay Strea Routing and Content Caching in Hybrid Coalition Networks Mostafa Dehghan, Anand Seethara, Ting He, Theodoros Salonidis Ji Kurose, Don Towsley, Bo Jiang, Raesh Sitaraan University of Massachussetts
More informationImage Filter Using with Gaussian Curvature and Total Variation Model
IJECT Vo l. 7, Is s u e 3, Ju l y - Se p t 016 ISSN : 30-7109 (Online) ISSN : 30-9543 (Print) Iage Using with Gaussian Curvature and Total Variation Model 1 Deepak Kuar Gour, Sanjay Kuar Shara 1, Dept.
More informationAuthor. Published. Journal Title DOI. Copyright Statement. Downloaded from. Griffith Research Online. Kandjani, Hadi, Wen, Larry, Bernus, Peter
Enterprise Architecture Cybernetics for Global Mining Projects: Reducing the Structural Coplexity of Global Mining Supply Networks via Virtual Brokerage Author Kandjani, Hadi, Wen, Larry, Bernus, Peter
More informationλ-harmonious Graph Colouring Lauren DeDieu
λ-haronious Graph Colouring Lauren DeDieu June 12, 2012 ABSTRACT In 198, Hopcroft and Krishnaoorthy defined a new type of graph colouring called haronious colouring. Haronious colouring is a proper vertex
More informationAutomated Installation Verification of COMSOL via LiveLink for MATLAB
Autoated Installation Verification of COMSOL via LiveLink for MATLAB Michael W. Crowell Oak Ridge National Laboratory, PO Bo 2008 MS6423, Oak Ridge, TN 37831 crowellw@ornl.gov Abstract: Verifying that
More informationNON-RIGID OBJECT TRACKING: A PREDICTIVE VECTORIAL MODEL APPROACH
NON-RIGID OBJECT TRACKING: A PREDICTIVE VECTORIAL MODEL APPROACH V. Atienza; J.M. Valiente and G. Andreu Departaento de Ingeniería de Sisteas, Coputadores y Autoática Universidad Politécnica de Valencia.
More informationGeometry. The Method of the Center of Mass (mass points): Solving problems using the Law of Lever (mass points). Menelaus theorem. Pappus theorem.
Noveber 13, 2016 Geoetry. The Method of the enter of Mass (ass points): Solving probles using the Law of Lever (ass points). Menelaus theore. Pappus theore. M d Theore (Law of Lever). Masses (weights)
More information(Geometric) Camera Calibration
(Geoetric) Caera Calibration CS635 Spring 217 Daniel G. Aliaga Departent of Coputer Science Purdue University Caera Calibration Caeras and CCDs Aberrations Perspective Projection Calibration Caeras First
More informationScheduling Parallel Real-Time Recurrent Tasks on Multicore Platforms
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL., NO., NOV 27 Scheduling Parallel Real-Tie Recurrent Tasks on Multicore Platfors Risat Pathan, Petros Voudouris, and Per Stenströ Abstract We
More informationLECTURE NOTES Non-Linear Programming
CEE 6110 David Rosenberg p. 1 Learning Objectives LECTURE NOTES Non-Linear Programming 1. Write out the non-linear model formulation 2. Describe the difficulties of solving a non-linear programming model
More informationA Novel Fast Constructive Algorithm for Neural Classifier
A Novel Fast Constructive Algorith for Neural Classifier Xudong Jiang Centre for Signal Processing, School of Electrical and Electronic Engineering Nanyang Technological University Nanyang Avenue, Singapore
More informationEfficient Learning of Generalized Linear and Single Index Models with Isotonic Regression
Efficient Learning of Generalized Linear and Single Index Models with Isotonic Regression Sha M. Kakade Microsoft Research and Wharton, U Penn skakade@icrosoft.co Varun Kanade SEAS, Harvard University
More informationResearch on the Classification and Selection of Archive Texts with the Improved C4.5 Algorithm
INTERNATIONAL JOURNAL OF IRUITS, SYSTEMS AND SIGNAL PROESSING Volue 2, 208 Research on the lassification and Selection of Archive Texts with the Iproved 4.5 Algorith Xianbin Lv Abstract In the age of inforation
More information1 P a g e. F x,x...,x,.,.' written as F D, is the same.
11. The security syste at an IT office is coposed of 10 coputers of which exactly four are working. To check whether the syste is functional, the officials inspect four of the coputers picked at rando
More informationFebruary 19, Integer programming. Outline. Problem formulation. Branch-andbound
Olga Galinina olga.galinina@tut.fi ELT-53656 Network Analysis and Dimensioning II Department of Electronics and Communications Engineering Tampere University of Technology, Tampere, Finland February 19,
More informationVito R. Gervasi, Adam Schneider, Joshua Rocholl the Milwaukee School of Engineering, Milwaukee, Wisconsin
GEOMETRY AND PROCEDURE FOR BENCHMARKING SFF AND HYBRID FABRICATION PROCESS RESOLUTION Vito R. Gervasi, Ada Schneider, Joshua Rocholl the Milwaukee School of Engineering, Milwaukee, Wisconsin ABSTRACT Since
More information