ReportMachine2.6的转Excel怎么没用？

crier 2003-08-30 11:27:48

ReportMachine2。6的打印预览工具条上的转Excel的按钮怎么点击了没有什么作用？请问怎么才能让他有效

...全文

91 回复打赏收藏转发到动态举报

写回复

回复

切换为时间正序

请发表友善的回复…

发表回复

1、支持屏幕打印，控制方法多样，可以打印全部rxlib控件全部InfoPower控件,TDBGrid,TStringGrid,TImage,TEdit等,TDBGridEh,f1book,TDecisionGrid等等众多控件。(例子1,例子2,例子3,例子4,例子5) 　　2、支持最终用户设计、修改报表，只需连接相关的数据源，指出数据的位置（设置报表样式），无论是主从表，子报表，套表，都可迅速生成。开发一个报表只需几分钟的时间。　　3、报表样式可以保存为rmf格式，下次可通过读入使用（配合SQL脚本就可以生成报表）。并可以把带数据的报表保存为rmp格式，在任何机器上都可以浏览、打印，而不需要数据库。　　4、生成后的报表支持修改，包括字体的设置，边框的设置，修改内容等。　　5、报表编辑器内自带ado,bde,ibx,Diamond dao,dbisam等数据访问控件，可以通过这些控件开发独立的报表制作工具。其使用方法和delphi中的控件是一样的。　　6、完全、自由自定义页面、边距、字体,标题和页眉页脚，并可以在自认合适的地方插入函数来实现当前日期，页合计，总合计等功能,合计字段可以放在页头，分组头，并支持条件合计，对分组合计，分页合计，总计等只需简单地设置属性即可。　　7、完全支持D5--D7，BCB5--BCB6。　　8、报表中可以在自认合适的事件(on beforeprint,on afterprint等)中加入程序脚本，以控制、或实现更复杂的打印效果。　　9、更新迅速，可根据使用人员与用户的意见，不断的加入新的功能。　　10、多种格式转换，可以把做出的报表转换为html,xls,pdf,bmp,jpeg等等格式。　　11、自动对超长记录折行，超长的内容也会自动折行，中文换行不会乱码。　　12、首家支持缩放打印功能，可以根据打印时选择的纸张自动缩放报表。　　13、首家支持即打即停．　　14、首家提供类似excel的报表设计器，给你足够灵活方表的报表设计方式。　　15、首家提供双报表设计器（第一种，第二种），满足所有的需求。　　16、更是提供类似于ObjectPascal的script,实现特殊功能。　　17、首家提供web,IntraWeb中的报表解决方案。　　18、首家提供报表压缩处理，占用内存更少，生成报表速度更快。　　19、首家提供合并单元格功能，更加适应处理复杂的中文报表。　　20、自动填空行，每页打印数量等细节处理更完善。

List of Figures...................................................................................................... xv List of Tables ...................................................................................................... xxi List of Mathematical Notations .................................................................... xxiv Preface ................................................................................................................. xxv Acknowledgments ........................................................................................... xxix Authors............................................................................................................... xxxi Section I Introduction to Optimization and Modelling 1 Introduction ......................................................................................................3 1.1 General Introduction .............................................................................3 1.2 History of Optimization .......................................................................4 1.3 Optimization Problems.........................................................................5 1.4 Mathematical Model..............................................................................6 1.4.1 Characteristics and Assumptions ........................................... 6 1.5 Concept of Optimization ......................................................................8 1.6 Classification of Optimization Problems .........................................11 1.7 Organization of the Book ...................................................................13 Exercises ...........................................................................................................14 References ........................................................................................................15 2 The Process of Optimization.......................................................................17 2.1 Introduction ..........................................................................................17 2.2 Decision Process...................................................................................17 2.3 Problem Identification and Clarification .........................................19 2.4 Problem Definition ..............................................................................20 2.5 Development of a Mathematical Model ..........................................21 2.5.1 Measure of Effectiveness........................................................ 23 2.6 Deriving a Solution..............................................................................25 2.7 Sensitivity Analysis .............................................................................26 2.8 Testing the Solution.............................................................................26 2.9 Implementation ....................................................................................27 v 2.10 Summary ...............................................................................................28 Exercises ...........................................................................................................29 3 Introduction to Modelling ...........................................................................31 3.1 Introduction ..........................................................................................31 3.2 Components of a Mathematical Model............................................31 3.2.1 Decision Variables................................................................... 32 3.2.2 Objective Function................................................................... 32 3.2.3 Constraints................................................................................ 32 3.3 Simple Examples..................................................................................32 3.4 Analyzing a Problem...........................................................................34 3.4.1 A Nonmathematical Programming Problem...................... 35 3.5 Modelling a Simple Problem .............................................................36 3.5.1 Defining the Variables ............................................................ 37 3.5.2 Objective Function................................................................... 37 3.5.3 Constraints................................................................................ 37 3.6 Linear Programming Model ..............................................................39 3.7 More Mathematical Models ...............................................................39 3.8 Integer Programming..........................................................................42 3.9 Multi-Objective Problem.....................................................................45 3.9.1 Objective versus Goal ............................................................. 47 3.10 Goal Programming ..............................................................................47 3.11 Nonlinear Programming.....................................................................49 3.12 Summary ...............................................................................................52 Exercises ...........................................................................................................52 Section II Modelling Techniques 4 Simple Modelling Techniques I ................................................................59 4.1 Introduction ..........................................................................................59 4.2 Use of Subscripts in Variables ...........................................................59 4.3 Simple Modelling Techniques ...........................................................60 4.3.1 Additional Work Requirement in the Formulation........... 61 4.3.2 Variables as Fractions of Other Variables ........................... 64 4.3.3 Maintaining Certain Ratios among Different Variables .... 68 4.3.4 One Constraint Is a Fraction of Another Constraint ......... 70 4.3.5 Maxi–Min or Mini–Max Objective Function....................... 75 4.3.6 Multi-Period Modelling.......................................................... 77 4.3.7 Transforming Infeasible Solutions to Satisfactory Solutions.................................................................................... 79 4.3.8 Single to Multiple Objectives ................................................ 81 4.4 Special Types of Linear Programming.............................................82 4.4.1 Transportation Problem ......................................................... 83 4.4.2 Assignment Problem .............................................................. 86 4.4.3 Transshipment Problem ......................................................... 88 4.4.4 Project Management Problem ............................................... 91 vi 4.5 Summary ...............................................................................................98 Exercises ...........................................................................................................98 Bibliography ..................................................................................................102 5 Simple Modelling Techniques II .............................................................103 5.1 Introduction ........................................................................................103 5.2 Precedence Constraints.....................................................................103 5.3 Either–or Constraints ........................................................................104 5.4 K out of N Constraints Must Hold .................................................105 5.5 Yes-or-No Decisions ..........................................................................106 5.6 Functions with N Possible Values...................................................108 5.7 Mutually Exclusive Alternatives and Contingent Decisions......109 5.8 Linking Constraints with the Objective Function ........................111 5.9 Piecewise Linear Functions ..............................................................113 5.10 Nonlinear to Approximate Functions ............................................116 5.11 Deterministic Models with Probability Terms..............................118 5.12 Alternate Objective Functions .........................................................121 5.13 Constrained to Unconstrained Problem ........................................122 5.14 Simplifying Cross Product of Binary Variables............................124 5.15 Fractional Programming...................................................................126 5.16 Unrestricted Variables.......................................................................128 5.17 Changing Constraint and Objective Type .....................................129 5.17.1 From to¼Constraints..................................................... 129 5.17.2 From to¼Constraints..................................................... 130 5.17.3 From to Constraints.................................................... 130 5.17.4 From to Constraints.................................................... 130 5.17.5 From ¼ Constraint to and Constraints.................... 130 5.17.6 Changing Objective Type................................................... 131 5.18 Conditional Constraints....................................................................132 5.19 Dual Formulation...............................................................................133 5.20 Regression Model ..............................................................................136 5.21 Stochastic Programming...................................................................137 5.22 Constraint Programming..................................................................137 5.23 Summary .............................................................................................138 Exercises .........................................................................................................138 Bibliography ..................................................................................................142 References ......................................................................................................143 6 Modelling Large-Scale and Well-Known Problems I..........................145 6.1 Introduction ........................................................................................145 6.2 Use of the Summation (S) Sign.......................................................145 6.3 Use of the Subset (2) Sign ................................................................147 6.4 Network Flow Problems...................................................................149 6.4.1 Shortest Path Problem ........................................................ 149 6.4.2 Maximum Flow Problem ................................................... 150 6.4.3 Multi-Commodity Flow Problem ..................................... 152 vii 6.5 Knapsack Problem...............................................................................154 6.5.1 Capital Budgeting Problem................................................... 154 6.5.2 Bin Packing Problem .............................................................. 155 6.5.3 Cutting Stock Problem ........................................................... 157 6.6 Facility Location and Layout .............................................................159 6.6.1 Facility Location Problem...................................................... 159 6.6.2 Facility Layout Problem......................................................... 161 6.7 Production Planning and Scheduling ..............................................164 6.7.1 Relevant Literature ................................................................. 165 6.8 Logistics and Transportation .............................................................167 6.8.1 Airlift Problem ........................................................................ 167 6.8.2 Relevant Literature ................................................................. 168 6.9 Summary ...............................................................................................170 Exercises .........................................................................................................170 References ......................................................................................................172 7 Modelling Well-Known Problems II.......................................................177 7.1 Introduction ..........................................................................................177 7.2 Job and Machine Scheduling .............................................................177 7.2.1 Relevant Literature ................................................................. 179 7.3 Assignment and Routing....................................................................180 7.3.1 Generalized Assignment Problem ....................................... 180 7.3.2 Traveling Salesperson Problem............................................ 181 7.3.3 Relevant Literature on Traveling Salesperson Problem..................................................................................... 184 7.3.4 Vehicle Routing Problem....................................................... 185 7.3.5 Relevant Literature on Vehicle Routing Problem ............. 188 7.4 Staff Rostering and Scheduling .........................................................189 7.4.1 Staff Scheduling: A Weekly Problem .................................. 189 7.4.2 Daily Rostering Problem ....................................................... 191 7.4.3 Relevant Literature on General Staff Scheduling .............. 192 7.4.4 Crew Planning=Scheduling Problem................................... 193 7.5 Scheduling and Timetabling Problem..............................................194 7.5.1 School Timetabling Problem................................................. 194 7.5.2 University Timetabling .......................................................... 196 7.5.3 Relevant Literature ................................................................. 197 7.6 Summary ...............................................................................................199 Exercises .........................................................................................................199 References ......................................................................................................201 8 Alternative Modelling ................................................................................205 8.1 Introduction ..........................................................................................205 8.2 Modelling under Different Assumptions ........................................205 8.2.1 A Coal Blending Problem...................................................... 205 8.2.2 First Alternative Blending Model ........................................ 207 8.2.3 Second Alternative Blending Model.................................... 209 viii 8.2.4 Comparing the Two Simple Alternative Models ........... 210 8.2.5 A Crop Planning Problem.................................................. 211 8.2.6 Crop Planning Model 1 ...................................................... 212 8.2.7 Crop Planning Model 2 ...................................................... 213 8.3 Hierarchical Modelling: An Introduction.....................................214 8.3.1 Hierarchical Modelling in a Manufacturing Context .... 215 8.3.2 Aggregate Model ................................................................. 216 8.3.3 Family Scheduling Model .................................................. 217 8.3.4 Individual Item Scheduling Model................................... 218 8.4 Summary ............................................................................................219 References ......................................................................................................220 Section III Model Solving 9 Solution Approaches: An Overview........................................................223 9.1 Introduction .......................................................................................223 9.2 Complexity and Complexity Classes ............................................223 9.2.1 Complexity of Algorithms.................................................. 223 9.2.2 Complexity Classes.............................................................. 224 9.3 Classical Optimization Techniques................................................225 9.3.1 Linear Programming............................................................ 225 9.3.2 Integer Programming: The Curse of Dimensionality ................................................................. 227 9.3.3 Integer Linear Program: Solution Approaches ............... 228 9.3.4 Special Linear Programming Models ............................... 230 9.3.5 Goal Programming............................................................... 230 9.3.6 Nonlinear Programming..................................................... 231 9.3.7 Multi-Objective Models....................................................... 232 9.4 Heuristic Techniques........................................................................233 9.4.1 Hill Climbing ........................................................................ 233 9.4.2 Simulated Annealing ........................................................... 233 9.4.3 Tabu Search........................................................................... 234 9.4.4 Genetic Algorithms.............................................................. 234 9.4.5 Ant Colony Optimization ................................................... 235 9.4.6 Memetic Algorithms ............................................................ 236 9.4.7 Other Heuristics ................................................................... 236 9.5 Optimization Software.....................................................................236 9.5.1 LINGO=LINDO .................................................................... 237 9.5.2 MPL with OptiMax 2000, CPLEX, and XPRESS........................................................................... 237 9.5.3 GAMS..................................................................................... 237 9.5.4 Solver and Premium Solver................................................ 238 9.5.5 Win QSB................................................................................. 238 9.5.6 MINOS ................................................................................... 238 9.6 Summary ............................................................................................239 ix References ....................................................................................................239 Appendix-9A LINGO: An Introduction .................................................241 9A.1 Introduction.....................................................................................241 9A.2 Inputting Model in LINGO...........................................................241 9A.3 Solving the Model...........................................................................243 9A.3.1 Solver Status Window.................................................... 243 9A.3.2 LINGO Special Features ................................................ 244 9A.4 Another Example............................................................................246 9A.4.1 Objective Function .......................................................... 246 9A.4.2 Constraints ....................................................................... 247 9A.4.3 Complete LINGO Model ............................................... 248 9A.4.4 Defining the Sets ............................................................. 249 9A.4.5 Inputting the Data .......................................................... 250 9A.5 LINGO Syntax.................................................................................252 Appendix-9B MPL: An Introduction.......................................................253 9B.1 Introduction .....................................................................................253 9B.2 Use of MPL......................................................................................253 9B.3 Using Vectors and Indexes in MPL.............................................255 9B.4 A Product-Mix Model with Three Variables .............................256 Appendix-9C GAMS: An Introduction...................................................260 9C.1 Introduction.....................................................................................260 9C.2 An Example.....................................................................................260 Appendix-9D Excel Solver: An Introduction .........................................264 9D.1 Introduction.....................................................................................264 9D.2 Solving Linear Programs with Solver .........................................264 9D.2.1 Defining the Target Cell (Objective Function) ........... 266 9D.2.2 Identifying the Changing Cells (Decision Variables) ........................................................ 266 9D.2.3 Adding Constraints ........................................................ 267 9D.2.4 Some Important Options ............................................... 269 9D.2.5 The Solution ..................................................................... 270 Appendix-9E Win QSB: An Introduction ...............................................273 9E.1 Introduction.....................................................................................273 9E.2 Problem Solving with Win QSB...................................................273 9E.3 Reference..........................................................................................275 10 Input Preparation and Model Solving ..................................................277 10.1 Introduction .....................................................................................277 10.2 Data and Data Collection ..............................................................277 10.3 Data Type.........................................................................................279 10.4 Data Preparation .............................................................................280 10.4.1 Data Requirements ......................................................... 282 10.4.2 Data Aggregation............................................................ 283 10.5 Data Preprocessing .........................................................................287 10.6 Model-Driven Data versus Data-Driven Model ........................292 x 10.7 Model Solving .................................................................................292 10.7.1 Excel Solver ....................................................................... 293 10.7.2 LINGO and MPL.............................................................. 295 10.8 Summary .........................................................................................304 Exercises .......................................................................................................304 References.....................................................................................................308 Appendix-10A Additional Problem-Solving Using LINGO ...............309 10A.1 Example 4.6 (Model 4.7) ..............................................................309 10A.1.1 LINGO Code ................................................................ 309 10A.1.2 LINGO Solution ........................................................... 310 10A.2 A Transportation Model ..............................................................310 10A.2.1 LINGO in Algebraic Form ......................................... 311 10A.2.2 LINGO Solution Report.............................................. 311 10A.2.3 LINGO Codes (Alternative)....................................... 312 10A.2.4 LINGO Solution Report (Using Alternative Codes)....................................................... 312 10A.2.5 A Modified Transportation Model ........................... 313 10A.2.6 LINGO Solution Report (with Restricted Path)............................................................................... 314 10A.3 Example 4.14 (Model 4.15) ..........................................................315 10A.3.1 LINGO in Algebraic Form......................................... 315 10A.3.2 LINGO Solution Report ............................................. 316 10A.3.3 LINGO Codes (Alternative Form)............................ 316 10A.3.4 LINGO Solution Report (for Alternative Codes)............................................... 317 10A.4 Example 3.6 (Model 4.1) ..............................................................318 10A.4.1 LINGO in Algebraic Form......................................... 318 10A.4.2 LINGO Model Statistics ............................................. 318 10A.4.3 LINGO Solution........................................................... 318 10A.4.4 LINGO Codes (Alternative Form)............................ 319 10A.4.5 LINGO Solution for Alternative Codes................... 319 10A.5 Example 5.3 (Model 5.2) ..............................................................320 10A.5.1 LINGO Codes .............................................................. 320 10A.5.2 LINGO Solution Report ............................................. 321 10A.5.3 LINGO Alternative Codes ......................................... 321 10A.5.4 LINGO Solution Report (for Alternative Codes)............................................................................ 321 10A.6 Example 5.16..................................................................................322 10A.6.1 LINGO Codes .............................................................. 322 10A.6.2 LINGO Solution Report ............................................. 322 10A.7 Example 4.11 (Model 4.12) ..........................................................323 10A.7.1 LINGO Codes .............................................................. 323 10A.7.2 LINGO Solution Report ............................................. 324 10A.8 Example 5.10 (Model 5.7) ............................................................324 10A.8.1 LINGO Codes .............................................................. 324 10A.8.2 LINGO Solution Report ............................................. 325 xi 11

本课程是PowerBI系列课程之Report Server专题 1. Report Server介绍及与Service版本的区别 2. Report Server下载安装和配置 3. 安装PowerBI Desktop RS版本和发布报表 4. Report Portal访问...

• Table of Contents • Index • Reviews • Reader Reviews • Errata • Academic Python Cookbook, 2nd Edition By David Ascher, Alex Martelli, Anna Ravenscroft Publisher : O'Reilly Pub Date : March 2005 ISBN : 0-596-00797-3 Pages : 844 Copyright Preface The Design of the Book The Implementation of the Book Using the Code from This Book Audience Organization Further Reading Conventions Used in This Book How to Contact Us Safari® Enabled Acknowledgments Chapter 1. Text Introduction Recipe 1.1. Processing a String One Character at a Time Recipe 1.2. Converting Between Characters and Numeric Codes Recipe 1.3. Testing Whether an Object Is String-like Recipe 1.4. Aligning Strings Recipe 1.5. Trimming Space from the Ends of a String Recipe 1.6. Combining Strings Recipe 1.7. Reversing a String by Words or Characters Recipe 1.8. Checking Whether a String Contains a Set of Characters Recipe 1.9. Simplifying Usage of Strings' translate Method Recipe 1.10. Filtering a String for a Set of Characters Recipe 1.11. Checking Whether a String Is Text or Binary Recipe 1.12. Controlling Case Recipe 1.13. Accessing Substrings Recipe 1.14. Changing the Indentation of a Multiline String Recipe 1.15. Expanding and Compressing Tabs Recipe 1.16. Interpolating Variables in a String Recipe 1.17. Interpolating Variables in a Stringin Python 2.4 Recipe 1.18. Replacing Multiple Patterns in a Single Pass Recipe 1.19. Checking a String for Any of Multiple Endings Recipe 1.20. Handling International Text with Unicode Recipe 1.21. Converting Between Unicode and Plain Strings Recipe 1.22. Printing Unicode Charactersto Standard Output

RM(Report Machine)是一个功能强大的Delphi报表控件包。使用它可以制作出非常复杂的报表。下面讲述最简单的用法：在Form上放上两个数据库控件：ADOConnection和ADOQuery设置好ADOConnection的ConnectionString。LoginPrompt=False。ADOQuery的Connection指向ADOConnection。ADOQuery...

5,386

社区成员

262,729

社区内容

发帖

与我相关

我的任务

社区管理员

加入社区

近7日
近30日
至今

加载中

查看更多榜单

社区公告

暂无公告

试试用AI创作助手写篇文章吧

+ 用AI写文章