卸载方方格子

已于 2023-01-09 11:26:09 修改
阅读量5.7k 收藏 6
点赞数 7
文章标签： 运维
于 2022-10-27 12:01:37 首次发布
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/stqer/article/details/127546934
版权

没卸载干净的方方格子，简直就是噩梦，一旦打开excel，就无限弹出报错框
在这里插入图片描述
一、正常卸载
控制面板和360卫士的常规卸载，对该同志，无一生效。

二、删除剩党
不出意外的出意外，依旧报错
在这里插入图片描述
三、终极方法
从配置项中搜索office，删除带有“tool”的软件，终于清静了
在这里插入图片描述
在这里插入图片描述

fo安方
关注
  • 7
    点赞
  • 踩
  • 6
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论
Excel或者WPS 报insatlling Office Customization 路径找不到的问题
weixin_43773038的博客
02-20 3947
问题: 我的是安装方方格子之后报错(你可能会报多个错误，那么就需要重复修复过程) 这里就是方方格子修改了注册表信息，卸载的时候没有卸载干净。 解决方法: 主要思想就是删除没有用的注册表项： 快捷键 Win+R -> 输入regedit 回车 -> 直接搜索上面路径或者路径的一部分，通过右键然后删除查找出来的项 ...
方方格子软件
11-17
EXCEL插件！超级好用的工具，需要的直接下载！
else应输入一个语句是什么意思_5分钟学会Python的if条件判断语句
weixin_39631932的博客
11-30 3556
新朋友请点上方“数据分析师攻略”加关注在Excel中，if函数的使用十分普遍，使用if函数可以进行条件判断，根据判断的结果再计算相应的内容。同样，在Python中进行条件判断也使用if语句。Python中的if语句，也称为条件判断语句，是通过一条或多条语句的执行结果(True 或 False)来决定执行的代码块。常用的if 语句判断条件有>(大于)、=(大于等于)、<=(小于...
一款代注册机的刻录软件
06-17
一款代注册机的刻录软件 一款代注册机的刻录软件 一款代注册机的刻录软件
吾爱破解注册机生成器
05-18
吾爱破解网站里找来的注册机生成器，用用试试看吧，貌似我拥着还行
2_方方格子 Excel工具箱 V3.6.6.0 Setup.exe.zip
01-03
简单好用神器
ie9安装包_被Excel折磨哭的我，真后悔没早点安装这3个插件…（内附安装包）
weixin_39601511的博客
12-01 416
今天周五，我们聊点轻松的！相信大家，都很好奇这个问题：Excel 高手究竟怎样炼成的？难道，是他们天生智商高、后天又肯努力？还是……哎，不吊你们胃口了。其实呀，是你们的 Excel 里没有这些好用的插件。学会了它们，你也可以成为高手！But，高手除了会这些，还会把常用操作写成小工具，想看 Excel 高手都做过哪些小工具吗？别急，下一篇文章再告诉你！今天，我们就先一起扒一扒，在 Excel 中，有...
Excel收纳箱功能：将自己编写的破解工作表代码收藏
ffcell2016的博客
06-24 414
工作中肯定许多人会遇到这样的问题，自己编制的Excel工作表，添加了保护，而自己却忘记了密码，问题的关键是，多个工作表，每个工作表的密码都不一样，想尝试解密都没有办法，这个时候该怎么办呢？先看下面的动图演示来感受一下：（方方格子插件）​1.首先打开表格，每一个工作表都添加了密码保护，无法操作2.选择diy工具箱按钮，选择收纳箱，选项卡3.弹出对话框，我们选择本地按钮，也就是自己保存的本地VBA代码4.这里我们选择新建一个执行命令5.弹出界面，我们只需要将破解的vba代码，粘贴到文本区域即可，然后选择好分类，
卸载WPS后Office文档图标显示异常
qq_50932477的博客
08-10 5971
#WPS流氓软件！！！#WPS流氓软件！！！#WPS流氓软件！！！ 卸载WPS办公软件后Windows自带的office文档的图标会发生变化(变为白色)，打开系统注册表发现Windows自带的.docx，.Excel，.PPT，.xlsx的默认途径发生改变，恢复图标的解决方法： 1、win+R , 输入regedit，打开系统注册表； 2、找到HKEY_CLASSES_ROOT的.doc、.docx、.ppt、.pptx、.xls、.xlsx，删除。 3、找到HKEY_CLASSES_ROOT下的 Word
方方格子补丁_方方格子Excel工具箱WPS版本-方方格子(WPS版)附注册文件补丁下载V3.2.6.0测试版-西西软件下载...
weixin_40008566的博客
12-22 4612
方方格子(WPS版)附注册文件补丁是简是一款基于Excel、WPS的工具箱软件(Com加载项)，称FFCell，。用于增强了Excel、WPS程序的功能，提高用户工作效率。本版本采用VSTO开发，支持WPS。含审计、图片、邮件、公式向导工具箱、Excel汇总大师。软件说明软件安装后，方方格子提供以下功能：常用的文本处理、编辑、工作表、数据分析、视图工具、收纳箱、汇总拆分、打印、图片、姓名、身份证工...
Optimization Modelling A Practical Approach
03-22
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
方方格子 Excel工具箱 V3.6.8.2 Setup.rar
02-24
安装时务必装上 VSTO安装环境包。安装或者升级之前先关闭正在运行的Excel。
序列号程序.exe序列号程序.exe
04-15
序列号程序.exe
CorelWordPerfectOfficeX9Professional19.0.0.325特别版(附注册机安装破解教程)
08-06
WordPerfect Office X9破解版是一款由Corel公司推出的一体化套件办公软件，这款工具支持超过60种办公文件的格式，全面兼容Microsoft Office的各种格式，而且还享有强大的内置 PDF 功能、协作使用集成的软件和工作更智能、更快地使用所有新功能和经典的 WordPerfect 工作。超过 30 年历史的办公软件，本站免费提供WordPerfect Office X9专
压缩包破解工具，可暴力破解Passwarekit
04-14
可用于压缩包破解和压缩包暴力破解的工具Passwarekit破解版，可直接安装使用，资源来自互联网，亲测无毒可用，也可用于压缩包忘记密码/只记得密码的位数/一部分
方方格子-wps版.....
12-09
方方格子WPS版是一款专门针对WPS软件制作的辅助插件，包含方方格子工具箱、审计、图片、邮件等大师全套，高效提高用户工作效率，可以满足日常的工作需求，即便是在无网络状态下方方格子WPS版也能正常使用。
serv-u11破解含注册机
05-12
serv-u11破解含注册机,绝对好用，不报毒。
小学生数学网站.xlsx
02-23
小学生数学网站小学生数学网站小学生数学网站小学生数学网站小学生数学网站小学生数学网站小学生数学网站小学生数学网站小学生数学网站小学生数学网站小学生数学网站小学生数学网站小学生数学网站小学生数学网站小学生数学网站guowai
EXCEL必备工具箱_V8.20_破解版.zip
01-15
EXCEL必备工具箱_V8.20_破解版.zip 绝对可用！请使用时候关闭安全软件，不然会被杀毒软件报警，破解版都这样，非常好用，
excel工具箱方方格子
最新发布
08-18
Excel工具箱方方格子是一个Excel插件，它提供了一系列方便的功能，帮助用户更高效地处理和分析数据。 该工具箱的主要特点包括： 1. 数据处理：方方格子提供了各种数据处理函数，如数据筛选、排序、合并等，帮助用户快速整理和清洗数据。 2. 数据分析：方方格子内置了常用的统计分析函数，如求和、平均值、最大值、最小值等，方便用户进行数据分析和报表制作。 3. 数据可视化：方方格子支持多种数据可视化图表，如柱状图、折线图、饼图等，用户可以直观地展示和比较数据。 4. 数据导入导出：方方格子可以方便地将数据导入到Excel中，也可以将Excel数据导出为其他格式，如CSV、PDF等。 5. 自定义功能：方方格子还支持用户自定义函数和宏，满足个性化需求，提升工作效率。 总之，Excel工具箱方方格子是一个功能强大的Excel插件，通过提供丰富的数据处理、分析和可视化功能，帮助用户更好地利用Excel进行数据处理和报表制作。

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

fo安方

觉得俺的文章还行，感谢打赏，爱

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付：¥1
获取中
扫码支付

您的余额不足，请更换扫码支付或充值

打赏作者

实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值